./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi007_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/rfi007_pso.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 dedc810acc4467f8e4edbf8d04a42f4c473bdb36 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-91b1670 [2018-11-28 20:22:08,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:22:08,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:22:08,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:22:08,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:22:08,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:22:08,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:22:08,907 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:22:08,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:22:08,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:22:08,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:22:08,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:22:08,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:22:08,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:22:08,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:22:08,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:22:08,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:22:08,920 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:22:08,922 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:22:08,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:22:08,925 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:22:08,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:22:08,929 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:22:08,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:22:08,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:22:08,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:22:08,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:22:08,934 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:22:08,935 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:22:08,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:22:08,937 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:22:08,937 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:22:08,938 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:22:08,938 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:22:08,939 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:22:08,941 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:22:08,941 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:22:08,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:22:08,968 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:22:08,969 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:22:08,969 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:22:08,970 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:22:08,970 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:22:08,971 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:22:08,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:22:08,971 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:22:08,971 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:22:08,972 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:22:08,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:22:08,972 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:22:08,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:22:08,972 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:22:08,972 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:22:08,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:22:08,974 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:22:08,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:22:08,975 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:22:08,975 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:22:08,975 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:22:08,976 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:22:08,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:22:08,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:22:08,976 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:22:08,976 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:22:08,977 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:22:08,977 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:22:08,977 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:22:08,977 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 -> dedc810acc4467f8e4edbf8d04a42f4c473bdb36 [2018-11-28 20:22:09,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:22:09,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:22:09,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:22:09,058 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:22:09,058 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:22:09,059 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi007_pso.opt_false-unreach-call.i [2018-11-28 20:22:09,135 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc10cafb/5662456375b9407496411170ee33f8c2/FLAGb105da2ae [2018-11-28 20:22:09,743 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:22:09,744 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi007_pso.opt_false-unreach-call.i [2018-11-28 20:22:09,762 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc10cafb/5662456375b9407496411170ee33f8c2/FLAGb105da2ae [2018-11-28 20:22:09,993 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc10cafb/5662456375b9407496411170ee33f8c2 [2018-11-28 20:22:09,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:22:09,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:22:09,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:22:09,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:22:10,003 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:22:10,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:09" (1/1) ... [2018-11-28 20:22:10,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6912cd91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10, skipping insertion in model container [2018-11-28 20:22:10,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:09" (1/1) ... [2018-11-28 20:22:10,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:22:10,080 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:22:10,508 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:22:10,528 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:22:10,633 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:22:10,857 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:22:10,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10 WrapperNode [2018-11-28 20:22:10,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:22:10,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:22:10,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:22:10,861 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:22:10,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10" (1/1) ... [2018-11-28 20:22:10,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10" (1/1) ... [2018-11-28 20:22:10,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:22:10,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:22:10,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:22:10,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:22:10,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10" (1/1) ... [2018-11-28 20:22:10,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10" (1/1) ... [2018-11-28 20:22:10,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10" (1/1) ... [2018-11-28 20:22:10,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10" (1/1) ... [2018-11-28 20:22:10,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10" (1/1) ... [2018-11-28 20:22:10,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10" (1/1) ... [2018-11-28 20:22:10,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10" (1/1) ... [2018-11-28 20:22:10,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:22:10,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:22:10,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:22:10,978 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:22:10,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10" (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-11-28 20:22:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:22:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:22:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:22:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:22:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:22:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:22:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:22:11,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:22:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:22:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:22:11,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:22:11,061 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:22:12,256 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:22:12,257 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:22:12,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:12 BoogieIcfgContainer [2018-11-28 20:22:12,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:22:12,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:22:12,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:22:12,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:22:12,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:09" (1/3) ... [2018-11-28 20:22:12,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b54b7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:12, skipping insertion in model container [2018-11-28 20:22:12,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:10" (2/3) ... [2018-11-28 20:22:12,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b54b7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:12, skipping insertion in model container [2018-11-28 20:22:12,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:12" (3/3) ... [2018-11-28 20:22:12,271 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_pso.opt_false-unreach-call.i [2018-11-28 20:22:12,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,327 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,327 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,327 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,328 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,328 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,329 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,332 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,333 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,343 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,344 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,344 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,344 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,346 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,349 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,350 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,351 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,352 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,353 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,353 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,353 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,353 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,353 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,354 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,354 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,354 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,354 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,355 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,357 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,358 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,358 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,359 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,362 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,362 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,363 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,365 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,365 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,365 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,365 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,366 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,366 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,366 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,366 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,366 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,366 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,368 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,369 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,370 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,371 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,373 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,373 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,373 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,373 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,373 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,374 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,374 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,374 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,374 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,374 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,375 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,376 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,377 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:22:12,418 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:22:12,419 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:22:12,429 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:22:12,448 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:22:12,476 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:22:12,476 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:22:12,477 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:22:12,477 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:22:12,477 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:22:12,477 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:22:12,477 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:22:12,477 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:22:12,477 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:22:12,492 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-11-28 20:22:14,872 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-11-28 20:22:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-11-28 20:22:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 20:22:14,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:14,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:22:14,887 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:14,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:14,895 INFO L82 PathProgramCache]: Analyzing trace with hash 829463542, now seen corresponding path program 1 times [2018-11-28 20:22:14,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:14,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:14,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:14,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:14,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:15,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:15,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:22:15,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:22:15,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:22:15,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:22:15,265 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-11-28 20:22:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:17,056 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-11-28 20:22:17,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:22:17,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-28 20:22:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:17,419 INFO L225 Difference]: With dead ends: 60790 [2018-11-28 20:22:17,420 INFO L226 Difference]: Without dead ends: 44270 [2018-11-28 20:22:17,422 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-11-28 20:22:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-11-28 20:22:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-11-28 20:22:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-11-28 20:22:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-11-28 20:22:19,442 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-11-28 20:22:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:19,444 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-11-28 20:22:19,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:22:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-11-28 20:22:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 20:22:19,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:19,464 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-11-28 20:22:19,465 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:19,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:19,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1614500037, now seen corresponding path program 1 times [2018-11-28 20:22:19,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:19,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:19,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:19,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:19,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:19,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:22:19,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:22:19,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:22:19,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:22:19,652 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-11-28 20:22:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:19,993 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-11-28 20:22:19,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:22:19,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-28 20:22:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:20,035 INFO L225 Difference]: With dead ends: 8528 [2018-11-28 20:22:20,035 INFO L226 Difference]: Without dead ends: 7466 [2018-11-28 20:22:20,036 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-11-28 20:22:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-11-28 20:22:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-11-28 20:22:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-11-28 20:22:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-11-28 20:22:20,244 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-11-28 20:22:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:20,246 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-11-28 20:22:20,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:22:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-11-28 20:22:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 20:22:20,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:20,250 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-11-28 20:22:20,250 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:20,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:20,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2087909407, now seen corresponding path program 1 times [2018-11-28 20:22:20,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:20,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:20,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:20,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:20,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:20,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:22:20,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:22:20,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:22:20,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:22:20,581 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-11-28 20:22:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:22,070 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-11-28 20:22:22,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:22:22,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-28 20:22:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:22,142 INFO L225 Difference]: With dead ends: 13998 [2018-11-28 20:22:22,142 INFO L226 Difference]: Without dead ends: 13930 [2018-11-28 20:22:22,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:22:22,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-11-28 20:22:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-11-28 20:22:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-11-28 20:22:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-11-28 20:22:22,413 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-11-28 20:22:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:22,415 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-11-28 20:22:22,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:22:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-11-28 20:22:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 20:22:22,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:22,418 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] [2018-11-28 20:22:22,419 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:22,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:22,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1703396709, now seen corresponding path program 1 times [2018-11-28 20:22:22,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:22,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:22,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:22,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:22,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:22,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:22,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:22:22,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:22:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:22:22,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:22:22,533 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-11-28 20:22:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:23,008 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-11-28 20:22:23,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:22:23,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 20:22:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:23,042 INFO L225 Difference]: With dead ends: 13279 [2018-11-28 20:22:23,043 INFO L226 Difference]: Without dead ends: 13279 [2018-11-28 20:22:23,043 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-11-28 20:22:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-11-28 20:22:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-11-28 20:22:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-11-28 20:22:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-11-28 20:22:23,314 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-11-28 20:22:23,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:23,314 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-11-28 20:22:23,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:22:23,315 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-11-28 20:22:23,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 20:22:23,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:23,319 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] [2018-11-28 20:22:23,319 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:23,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:23,319 INFO L82 PathProgramCache]: Analyzing trace with hash -778746896, now seen corresponding path program 1 times [2018-11-28 20:22:23,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:23,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:23,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:23,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:23,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:23,588 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 20:22:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:23,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:23,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:22:23,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:22:23,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:22:23,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:22:23,784 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-11-28 20:22:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:25,279 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-11-28 20:22:25,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:22:25,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-28 20:22:25,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:25,303 INFO L225 Difference]: With dead ends: 12285 [2018-11-28 20:22:25,303 INFO L226 Difference]: Without dead ends: 12213 [2018-11-28 20:22:25,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:22:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-11-28 20:22:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-11-28 20:22:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-11-28 20:22:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-11-28 20:22:25,547 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-11-28 20:22:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:25,548 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-11-28 20:22:25,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:22:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-11-28 20:22:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 20:22:25,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:25,556 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] [2018-11-28 20:22:25,556 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:25,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:25,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1619956916, now seen corresponding path program 1 times [2018-11-28 20:22:25,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:25,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:25,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:25,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:25,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:22:25,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:22:25,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:22:25,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:22:25,778 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-11-28 20:22:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:26,113 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-11-28 20:22:26,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:22:26,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-28 20:22:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:26,137 INFO L225 Difference]: With dead ends: 12396 [2018-11-28 20:22:26,138 INFO L226 Difference]: Without dead ends: 12396 [2018-11-28 20:22:26,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-28 20:22:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-11-28 20:22:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-11-28 20:22:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-11-28 20:22:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-11-28 20:22:26,392 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-11-28 20:22:26,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:26,393 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-11-28 20:22:26,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:22:26,394 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-11-28 20:22:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 20:22:26,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:26,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:22:26,405 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:26,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:26,405 INFO L82 PathProgramCache]: Analyzing trace with hash 122853419, now seen corresponding path program 1 times [2018-11-28 20:22:26,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:26,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:26,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:26,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:26,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:26,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:26,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:22:26,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:22:26,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:22:26,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:22:26,623 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-11-28 20:22:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:27,441 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-11-28 20:22:27,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:22:27,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-28 20:22:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:27,487 INFO L225 Difference]: With dead ends: 20969 [2018-11-28 20:22:27,487 INFO L226 Difference]: Without dead ends: 20898 [2018-11-28 20:22:27,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:22:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-11-28 20:22:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-11-28 20:22:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-11-28 20:22:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-11-28 20:22:28,138 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-11-28 20:22:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:28,138 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-11-28 20:22:28,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:22:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-11-28 20:22:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:22:28,153 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:28,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:22:28,154 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:28,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:28,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1407589042, now seen corresponding path program 1 times [2018-11-28 20:22:28,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:28,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:28,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:28,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:28,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:28,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:28,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:22:28,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:22:28,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:22:28,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:22:28,346 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-11-28 20:22:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:28,886 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2018-11-28 20:22:28,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:22:28,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 20:22:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:28,928 INFO L225 Difference]: With dead ends: 23352 [2018-11-28 20:22:28,928 INFO L226 Difference]: Without dead ends: 23352 [2018-11-28 20:22:28,929 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-11-28 20:22:28,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2018-11-28 20:22:29,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2018-11-28 20:22:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2018-11-28 20:22:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2018-11-28 20:22:29,210 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2018-11-28 20:22:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:29,210 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2018-11-28 20:22:29,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:22:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2018-11-28 20:22:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:22:29,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:29,218 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] [2018-11-28 20:22:29,219 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:29,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:29,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1114186035, now seen corresponding path program 1 times [2018-11-28 20:22:29,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:29,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:29,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:29,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:29,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:29,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:29,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:22:29,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:22:29,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:22:29,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:22:29,347 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2018-11-28 20:22:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:29,874 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2018-11-28 20:22:29,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:22:29,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 20:22:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:29,905 INFO L225 Difference]: With dead ends: 18411 [2018-11-28 20:22:29,906 INFO L226 Difference]: Without dead ends: 18411 [2018-11-28 20:22:29,906 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-11-28 20:22:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2018-11-28 20:22:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2018-11-28 20:22:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2018-11-28 20:22:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2018-11-28 20:22:30,178 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2018-11-28 20:22:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:30,179 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2018-11-28 20:22:30,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:22:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2018-11-28 20:22:30,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:22:30,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:30,191 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] [2018-11-28 20:22:30,191 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:30,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash -152572018, now seen corresponding path program 1 times [2018-11-28 20:22:30,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:30,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:30,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:30,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:30,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:30,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:30,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:22:30,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:22:30,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:22:30,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:22:30,355 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2018-11-28 20:22:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:30,677 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2018-11-28 20:22:30,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:22:30,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-28 20:22:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:30,709 INFO L225 Difference]: With dead ends: 17193 [2018-11-28 20:22:30,709 INFO L226 Difference]: Without dead ends: 17193 [2018-11-28 20:22:30,709 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-11-28 20:22:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2018-11-28 20:22:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2018-11-28 20:22:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2018-11-28 20:22:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2018-11-28 20:22:31,279 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2018-11-28 20:22:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:31,279 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2018-11-28 20:22:31,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:22:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2018-11-28 20:22:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:22:31,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:31,291 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] [2018-11-28 20:22:31,291 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:31,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:31,292 INFO L82 PathProgramCache]: Analyzing trace with hash -776511433, now seen corresponding path program 1 times [2018-11-28 20:22:31,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:31,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:31,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:31,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:31,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:31,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:22:31,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:22:31,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:22:31,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:22:31,607 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2018-11-28 20:22:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:33,102 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2018-11-28 20:22:33,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:22:33,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:22:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:33,137 INFO L225 Difference]: With dead ends: 20789 [2018-11-28 20:22:33,138 INFO L226 Difference]: Without dead ends: 20789 [2018-11-28 20:22:33,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:22:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2018-11-28 20:22:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2018-11-28 20:22:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2018-11-28 20:22:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2018-11-28 20:22:33,444 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2018-11-28 20:22:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:33,444 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2018-11-28 20:22:33,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:22:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2018-11-28 20:22:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:22:33,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:33,457 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] [2018-11-28 20:22:33,457 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:33,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash 185102584, now seen corresponding path program 1 times [2018-11-28 20:22:33,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:33,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:33,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:33,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:33,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:33,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:33,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:22:33,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:22:33,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:22:33,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:22:33,670 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2018-11-28 20:22:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:34,287 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2018-11-28 20:22:34,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:22:34,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 20:22:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:34,322 INFO L225 Difference]: With dead ends: 22441 [2018-11-28 20:22:34,323 INFO L226 Difference]: Without dead ends: 22441 [2018-11-28 20:22:34,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:22:34,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2018-11-28 20:22:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2018-11-28 20:22:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2018-11-28 20:22:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2018-11-28 20:22:34,619 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2018-11-28 20:22:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:34,619 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2018-11-28 20:22:34,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:22:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2018-11-28 20:22:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:22:34,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:34,631 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] [2018-11-28 20:22:34,632 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:34,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:34,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1429867065, now seen corresponding path program 1 times [2018-11-28 20:22:34,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:34,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:34,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:34,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:34,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:34,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:34,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:22:34,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:22:34,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:22:34,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:22:34,852 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2018-11-28 20:22:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:35,366 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2018-11-28 20:22:35,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:22:35,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:22:35,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:35,406 INFO L225 Difference]: With dead ends: 26432 [2018-11-28 20:22:35,406 INFO L226 Difference]: Without dead ends: 26432 [2018-11-28 20:22:35,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:22:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2018-11-28 20:22:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2018-11-28 20:22:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2018-11-28 20:22:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2018-11-28 20:22:35,800 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2018-11-28 20:22:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:35,801 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2018-11-28 20:22:35,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:22:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2018-11-28 20:22:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:22:35,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:35,816 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] [2018-11-28 20:22:35,816 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:35,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:35,817 INFO L82 PathProgramCache]: Analyzing trace with hash 919332888, now seen corresponding path program 1 times [2018-11-28 20:22:35,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:35,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:35,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:36,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:36,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:22:36,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:22:36,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:22:36,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:22:36,232 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2018-11-28 20:22:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:37,279 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2018-11-28 20:22:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:22:37,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:22:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:37,336 INFO L225 Difference]: With dead ends: 33063 [2018-11-28 20:22:37,336 INFO L226 Difference]: Without dead ends: 33063 [2018-11-28 20:22:37,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:22:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2018-11-28 20:22:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2018-11-28 20:22:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2018-11-28 20:22:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2018-11-28 20:22:37,732 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2018-11-28 20:22:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:37,732 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2018-11-28 20:22:37,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:22:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2018-11-28 20:22:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:22:37,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:37,745 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] [2018-11-28 20:22:37,746 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:37,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash -888121575, now seen corresponding path program 1 times [2018-11-28 20:22:37,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:37,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:37,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:37,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:37,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:37,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:37,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:22:37,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:22:37,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:22:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:22:37,942 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 5 states. [2018-11-28 20:22:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:37,998 INFO L93 Difference]: Finished difference Result 9075 states and 21914 transitions. [2018-11-28 20:22:37,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:22:37,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:22:37,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:38,007 INFO L225 Difference]: With dead ends: 9075 [2018-11-28 20:22:38,008 INFO L226 Difference]: Without dead ends: 7223 [2018-11-28 20:22:38,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:22:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7223 states. [2018-11-28 20:22:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7223 to 6120. [2018-11-28 20:22:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2018-11-28 20:22:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 14385 transitions. [2018-11-28 20:22:38,080 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 14385 transitions. Word has length 66 [2018-11-28 20:22:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:38,081 INFO L480 AbstractCegarLoop]: Abstraction has 6120 states and 14385 transitions. [2018-11-28 20:22:38,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:22:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 14385 transitions. [2018-11-28 20:22:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:22:38,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:38,088 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] [2018-11-28 20:22:38,088 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:38,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1563910716, now seen corresponding path program 1 times [2018-11-28 20:22:38,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:38,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:38,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:38,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:38,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:22:38,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:22:38,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:22:38,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:22:38,173 INFO L87 Difference]: Start difference. First operand 6120 states and 14385 transitions. Second operand 3 states. [2018-11-28 20:22:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:38,279 INFO L93 Difference]: Finished difference Result 8339 states and 19492 transitions. [2018-11-28 20:22:38,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:22:38,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-28 20:22:38,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:38,289 INFO L225 Difference]: With dead ends: 8339 [2018-11-28 20:22:38,290 INFO L226 Difference]: Without dead ends: 8339 [2018-11-28 20:22:38,290 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-11-28 20:22:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8339 states. [2018-11-28 20:22:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8339 to 6059. [2018-11-28 20:22:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6059 states. [2018-11-28 20:22:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6059 states to 6059 states and 13925 transitions. [2018-11-28 20:22:38,361 INFO L78 Accepts]: Start accepts. Automaton has 6059 states and 13925 transitions. Word has length 66 [2018-11-28 20:22:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:38,362 INFO L480 AbstractCegarLoop]: Abstraction has 6059 states and 13925 transitions. [2018-11-28 20:22:38,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:22:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 6059 states and 13925 transitions. [2018-11-28 20:22:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:22:38,370 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:38,370 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] [2018-11-28 20:22:38,370 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:38,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:38,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1344844335, now seen corresponding path program 1 times [2018-11-28 20:22:38,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:38,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:38,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:38,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:38,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:38,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:22:38,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:22:38,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:22:38,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:22:38,485 INFO L87 Difference]: Start difference. First operand 6059 states and 13925 transitions. Second operand 5 states. [2018-11-28 20:22:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:38,688 INFO L93 Difference]: Finished difference Result 7229 states and 16566 transitions. [2018-11-28 20:22:38,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:22:38,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-28 20:22:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:38,698 INFO L225 Difference]: With dead ends: 7229 [2018-11-28 20:22:38,698 INFO L226 Difference]: Without dead ends: 7229 [2018-11-28 20:22:38,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:22:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2018-11-28 20:22:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 6503. [2018-11-28 20:22:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2018-11-28 20:22:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 14929 transitions. [2018-11-28 20:22:38,763 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 14929 transitions. Word has length 72 [2018-11-28 20:22:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:38,764 INFO L480 AbstractCegarLoop]: Abstraction has 6503 states and 14929 transitions. [2018-11-28 20:22:38,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:22:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 14929 transitions. [2018-11-28 20:22:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 20:22:38,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:38,770 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] [2018-11-28 20:22:38,770 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:38,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:38,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1207312626, now seen corresponding path program 1 times [2018-11-28 20:22:38,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:38,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:38,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:38,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:38,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:39,018 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 20:22:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:39,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:39,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:22:39,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:22:39,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:22:39,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:22:39,131 INFO L87 Difference]: Start difference. First operand 6503 states and 14929 transitions. Second operand 9 states. [2018-11-28 20:22:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:39,767 INFO L93 Difference]: Finished difference Result 8529 states and 19410 transitions. [2018-11-28 20:22:39,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:22:39,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-11-28 20:22:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:39,784 INFO L225 Difference]: With dead ends: 8529 [2018-11-28 20:22:39,784 INFO L226 Difference]: Without dead ends: 8410 [2018-11-28 20:22:39,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:22:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8410 states. [2018-11-28 20:22:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8410 to 6600. [2018-11-28 20:22:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6600 states. [2018-11-28 20:22:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6600 states to 6600 states and 15022 transitions. [2018-11-28 20:22:39,870 INFO L78 Accepts]: Start accepts. Automaton has 6600 states and 15022 transitions. Word has length 72 [2018-11-28 20:22:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:39,870 INFO L480 AbstractCegarLoop]: Abstraction has 6600 states and 15022 transitions. [2018-11-28 20:22:39,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:22:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 6600 states and 15022 transitions. [2018-11-28 20:22:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:22:39,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:39,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 20:22:39,879 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:39,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:39,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1375926790, now seen corresponding path program 1 times [2018-11-28 20:22:39,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:39,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:39,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:39,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:39,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:39,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:39,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:39,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:22:39,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:22:39,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:22:39,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:22:39,995 INFO L87 Difference]: Start difference. First operand 6600 states and 15022 transitions. Second operand 4 states. [2018-11-28 20:22:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:40,364 INFO L93 Difference]: Finished difference Result 10287 states and 23293 transitions. [2018-11-28 20:22:40,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:22:40,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 20:22:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:40,379 INFO L225 Difference]: With dead ends: 10287 [2018-11-28 20:22:40,379 INFO L226 Difference]: Without dead ends: 10287 [2018-11-28 20:22:40,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:22:40,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10287 states. [2018-11-28 20:22:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10287 to 7720. [2018-11-28 20:22:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7720 states. [2018-11-28 20:22:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7720 states to 7720 states and 17356 transitions. [2018-11-28 20:22:40,473 INFO L78 Accepts]: Start accepts. Automaton has 7720 states and 17356 transitions. Word has length 91 [2018-11-28 20:22:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:40,474 INFO L480 AbstractCegarLoop]: Abstraction has 7720 states and 17356 transitions. [2018-11-28 20:22:40,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:22:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 7720 states and 17356 transitions. [2018-11-28 20:22:40,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 20:22:40,483 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:40,483 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] [2018-11-28 20:22:40,483 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:40,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:40,484 INFO L82 PathProgramCache]: Analyzing trace with hash 533882140, now seen corresponding path program 1 times [2018-11-28 20:22:40,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:40,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:40,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:40,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:40,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:40,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:40,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:22:40,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:22:40,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:22:40,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:22:40,708 INFO L87 Difference]: Start difference. First operand 7720 states and 17356 transitions. Second operand 4 states. [2018-11-28 20:22:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:40,834 INFO L93 Difference]: Finished difference Result 8285 states and 18649 transitions. [2018-11-28 20:22:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:22:40,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-28 20:22:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:40,844 INFO L225 Difference]: With dead ends: 8285 [2018-11-28 20:22:40,844 INFO L226 Difference]: Without dead ends: 8285 [2018-11-28 20:22:40,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:22:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8285 states. [2018-11-28 20:22:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8285 to 7626. [2018-11-28 20:22:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7626 states. [2018-11-28 20:22:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7626 states to 7626 states and 17251 transitions. [2018-11-28 20:22:40,926 INFO L78 Accepts]: Start accepts. Automaton has 7626 states and 17251 transitions. Word has length 91 [2018-11-28 20:22:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:40,926 INFO L480 AbstractCegarLoop]: Abstraction has 7626 states and 17251 transitions. [2018-11-28 20:22:40,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:22:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 7626 states and 17251 transitions. [2018-11-28 20:22:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:22:40,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:40,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] [2018-11-28 20:22:40,935 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:40,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:40,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1680047616, now seen corresponding path program 1 times [2018-11-28 20:22:40,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:40,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:40,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:40,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:40,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:41,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:41,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:22:41,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:22:41,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:22:41,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:22:41,256 INFO L87 Difference]: Start difference. First operand 7626 states and 17251 transitions. Second operand 7 states. [2018-11-28 20:22:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:43,525 INFO L93 Difference]: Finished difference Result 9400 states and 21199 transitions. [2018-11-28 20:22:43,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:22:43,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-11-28 20:22:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:43,541 INFO L225 Difference]: With dead ends: 9400 [2018-11-28 20:22:43,541 INFO L226 Difference]: Without dead ends: 9400 [2018-11-28 20:22:43,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:22:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9400 states. [2018-11-28 20:22:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9400 to 7738. [2018-11-28 20:22:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7738 states. [2018-11-28 20:22:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7738 states to 7738 states and 17571 transitions. [2018-11-28 20:22:43,748 INFO L78 Accepts]: Start accepts. Automaton has 7738 states and 17571 transitions. Word has length 93 [2018-11-28 20:22:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:43,749 INFO L480 AbstractCegarLoop]: Abstraction has 7738 states and 17571 transitions. [2018-11-28 20:22:43,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:22:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 7738 states and 17571 transitions. [2018-11-28 20:22:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:22:43,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:43,766 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] [2018-11-28 20:22:43,766 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:43,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:43,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1241251611, now seen corresponding path program 1 times [2018-11-28 20:22:43,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:43,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:43,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:43,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:43,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:44,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:44,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:22:44,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:22:44,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:22:44,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:22:44,149 INFO L87 Difference]: Start difference. First operand 7738 states and 17571 transitions. Second operand 5 states. [2018-11-28 20:22:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:44,642 INFO L93 Difference]: Finished difference Result 8645 states and 19529 transitions. [2018-11-28 20:22:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:22:44,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 20:22:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:44,654 INFO L225 Difference]: With dead ends: 8645 [2018-11-28 20:22:44,654 INFO L226 Difference]: Without dead ends: 8645 [2018-11-28 20:22:44,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:22:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8645 states. [2018-11-28 20:22:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8645 to 6634. [2018-11-28 20:22:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6634 states. [2018-11-28 20:22:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6634 states to 6634 states and 15090 transitions. [2018-11-28 20:22:44,746 INFO L78 Accepts]: Start accepts. Automaton has 6634 states and 15090 transitions. Word has length 93 [2018-11-28 20:22:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:44,746 INFO L480 AbstractCegarLoop]: Abstraction has 6634 states and 15090 transitions. [2018-11-28 20:22:44,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:22:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 6634 states and 15090 transitions. [2018-11-28 20:22:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:22:44,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:44,757 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] [2018-11-28 20:22:44,757 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:44,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:44,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1495988156, now seen corresponding path program 1 times [2018-11-28 20:22:44,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:44,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:44,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:45,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:45,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:22:45,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:22:45,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:22:45,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:22:45,055 INFO L87 Difference]: Start difference. First operand 6634 states and 15090 transitions. Second operand 5 states. [2018-11-28 20:22:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:45,513 INFO L93 Difference]: Finished difference Result 7882 states and 17730 transitions. [2018-11-28 20:22:45,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:22:45,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-28 20:22:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:45,524 INFO L225 Difference]: With dead ends: 7882 [2018-11-28 20:22:45,524 INFO L226 Difference]: Without dead ends: 7751 [2018-11-28 20:22:45,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:22:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7751 states. [2018-11-28 20:22:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7751 to 7373. [2018-11-28 20:22:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7373 states. [2018-11-28 20:22:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 16709 transitions. [2018-11-28 20:22:45,598 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 16709 transitions. Word has length 93 [2018-11-28 20:22:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:45,598 INFO L480 AbstractCegarLoop]: Abstraction has 7373 states and 16709 transitions. [2018-11-28 20:22:45,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:22:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 16709 transitions. [2018-11-28 20:22:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:22:45,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:45,609 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] [2018-11-28 20:22:45,609 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:45,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash -251223675, now seen corresponding path program 1 times [2018-11-28 20:22:45,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:45,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:45,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:45,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:45,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:46,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:46,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:22:46,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:22:46,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:22:46,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:22:46,078 INFO L87 Difference]: Start difference. First operand 7373 states and 16709 transitions. Second operand 6 states. [2018-11-28 20:22:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:46,758 INFO L93 Difference]: Finished difference Result 9406 states and 21103 transitions. [2018-11-28 20:22:46,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:22:46,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-28 20:22:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:46,771 INFO L225 Difference]: With dead ends: 9406 [2018-11-28 20:22:46,771 INFO L226 Difference]: Without dead ends: 9298 [2018-11-28 20:22:46,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:22:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9298 states. [2018-11-28 20:22:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9298 to 7200. [2018-11-28 20:22:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7200 states. [2018-11-28 20:22:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 16315 transitions. [2018-11-28 20:22:46,854 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 16315 transitions. Word has length 93 [2018-11-28 20:22:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:46,854 INFO L480 AbstractCegarLoop]: Abstraction has 7200 states and 16315 transitions. [2018-11-28 20:22:46,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:22:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 16315 transitions. [2018-11-28 20:22:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:22:46,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:46,862 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] [2018-11-28 20:22:46,862 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:46,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:46,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1344833246, now seen corresponding path program 1 times [2018-11-28 20:22:46,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:46,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:46,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:47,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:47,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:47,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:22:47,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:22:47,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:22:47,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:22:47,043 INFO L87 Difference]: Start difference. First operand 7200 states and 16315 transitions. Second operand 9 states. [2018-11-28 20:22:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:47,785 INFO L93 Difference]: Finished difference Result 10191 states and 23070 transitions. [2018-11-28 20:22:47,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 20:22:47,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-11-28 20:22:47,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:47,798 INFO L225 Difference]: With dead ends: 10191 [2018-11-28 20:22:47,798 INFO L226 Difference]: Without dead ends: 10159 [2018-11-28 20:22:47,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:22:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10159 states. [2018-11-28 20:22:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10159 to 9008. [2018-11-28 20:22:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2018-11-28 20:22:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 20407 transitions. [2018-11-28 20:22:47,903 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 20407 transitions. Word has length 93 [2018-11-28 20:22:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:47,904 INFO L480 AbstractCegarLoop]: Abstraction has 9008 states and 20407 transitions. [2018-11-28 20:22:47,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:22:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 20407 transitions. [2018-11-28 20:22:47,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:22:47,913 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:47,913 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] [2018-11-28 20:22:47,914 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:47,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:47,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1153182691, now seen corresponding path program 1 times [2018-11-28 20:22:47,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:47,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:47,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:47,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:47,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:48,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:48,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:22:48,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:22:48,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:22:48,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:22:48,768 INFO L87 Difference]: Start difference. First operand 9008 states and 20407 transitions. Second operand 8 states. [2018-11-28 20:22:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:49,845 INFO L93 Difference]: Finished difference Result 14357 states and 33169 transitions. [2018-11-28 20:22:49,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:22:49,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-11-28 20:22:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:49,864 INFO L225 Difference]: With dead ends: 14357 [2018-11-28 20:22:49,864 INFO L226 Difference]: Without dead ends: 14357 [2018-11-28 20:22:49,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:22:49,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14357 states. [2018-11-28 20:22:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14357 to 9634. [2018-11-28 20:22:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9634 states. [2018-11-28 20:22:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 22044 transitions. [2018-11-28 20:22:50,005 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 22044 transitions. Word has length 93 [2018-11-28 20:22:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:50,005 INFO L480 AbstractCegarLoop]: Abstraction has 9634 states and 22044 transitions. [2018-11-28 20:22:50,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:22:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 22044 transitions. [2018-11-28 20:22:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-28 20:22:50,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:50,016 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] [2018-11-28 20:22:50,016 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:50,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:50,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2040686372, now seen corresponding path program 1 times [2018-11-28 20:22:50,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:50,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:50,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:50,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:50,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:50,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:50,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:22:50,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:22:50,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:22:50,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:22:50,122 INFO L87 Difference]: Start difference. First operand 9634 states and 22044 transitions. Second operand 3 states. [2018-11-28 20:22:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:50,176 INFO L93 Difference]: Finished difference Result 9378 states and 21228 transitions. [2018-11-28 20:22:50,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:22:50,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-11-28 20:22:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:50,189 INFO L225 Difference]: With dead ends: 9378 [2018-11-28 20:22:50,189 INFO L226 Difference]: Without dead ends: 9346 [2018-11-28 20:22:50,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:22:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9346 states. [2018-11-28 20:22:50,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9346 to 7511. [2018-11-28 20:22:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7511 states. [2018-11-28 20:22:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7511 states to 7511 states and 16863 transitions. [2018-11-28 20:22:50,290 INFO L78 Accepts]: Start accepts. Automaton has 7511 states and 16863 transitions. Word has length 93 [2018-11-28 20:22:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:50,290 INFO L480 AbstractCegarLoop]: Abstraction has 7511 states and 16863 transitions. [2018-11-28 20:22:50,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:22:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 7511 states and 16863 transitions. [2018-11-28 20:22:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:22:50,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:50,299 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] [2018-11-28 20:22:50,299 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:50,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:50,300 INFO L82 PathProgramCache]: Analyzing trace with hash -639150898, now seen corresponding path program 1 times [2018-11-28 20:22:50,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:50,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:50,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:50,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:50,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:50,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:50,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:22:50,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:22:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:22:50,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:22:50,802 INFO L87 Difference]: Start difference. First operand 7511 states and 16863 transitions. Second operand 10 states. [2018-11-28 20:22:51,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:51,762 INFO L93 Difference]: Finished difference Result 9932 states and 22168 transitions. [2018-11-28 20:22:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 20:22:51,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-11-28 20:22:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:51,776 INFO L225 Difference]: With dead ends: 9932 [2018-11-28 20:22:51,776 INFO L226 Difference]: Without dead ends: 9932 [2018-11-28 20:22:51,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-11-28 20:22:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9932 states. [2018-11-28 20:22:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9932 to 8732. [2018-11-28 20:22:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8732 states. [2018-11-28 20:22:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8732 states to 8732 states and 19527 transitions. [2018-11-28 20:22:51,884 INFO L78 Accepts]: Start accepts. Automaton has 8732 states and 19527 transitions. Word has length 95 [2018-11-28 20:22:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:51,884 INFO L480 AbstractCegarLoop]: Abstraction has 8732 states and 19527 transitions. [2018-11-28 20:22:51,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:22:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 8732 states and 19527 transitions. [2018-11-28 20:22:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:22:51,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:51,894 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] [2018-11-28 20:22:51,895 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:51,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:51,895 INFO L82 PathProgramCache]: Analyzing trace with hash 248352783, now seen corresponding path program 1 times [2018-11-28 20:22:51,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:51,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:51,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:51,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:51,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:52,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:52,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:22:52,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:22:52,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:22:52,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:22:52,120 INFO L87 Difference]: Start difference. First operand 8732 states and 19527 transitions. Second operand 9 states. [2018-11-28 20:22:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:52,872 INFO L93 Difference]: Finished difference Result 10680 states and 23668 transitions. [2018-11-28 20:22:52,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 20:22:52,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-11-28 20:22:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:52,889 INFO L225 Difference]: With dead ends: 10680 [2018-11-28 20:22:52,889 INFO L226 Difference]: Without dead ends: 10680 [2018-11-28 20:22:52,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-11-28 20:22:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10680 states. [2018-11-28 20:22:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10680 to 9212. [2018-11-28 20:22:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9212 states. [2018-11-28 20:22:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9212 states to 9212 states and 20534 transitions. [2018-11-28 20:22:53,036 INFO L78 Accepts]: Start accepts. Automaton has 9212 states and 20534 transitions. Word has length 95 [2018-11-28 20:22:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:53,036 INFO L480 AbstractCegarLoop]: Abstraction has 9212 states and 20534 transitions. [2018-11-28 20:22:53,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:22:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 9212 states and 20534 transitions. [2018-11-28 20:22:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:22:53,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:53,049 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] [2018-11-28 20:22:53,050 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:53,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:53,050 INFO L82 PathProgramCache]: Analyzing trace with hash -427799985, now seen corresponding path program 1 times [2018-11-28 20:22:53,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:53,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:53,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:53,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:53,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:53,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:53,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 20:22:53,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 20:22:53,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 20:22:53,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:22:53,353 INFO L87 Difference]: Start difference. First operand 9212 states and 20534 transitions. Second operand 13 states. [2018-11-28 20:22:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:54,664 INFO L93 Difference]: Finished difference Result 12994 states and 28668 transitions. [2018-11-28 20:22:54,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 20:22:54,666 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2018-11-28 20:22:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:54,685 INFO L225 Difference]: With dead ends: 12994 [2018-11-28 20:22:54,685 INFO L226 Difference]: Without dead ends: 12994 [2018-11-28 20:22:54,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-11-28 20:22:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12994 states. [2018-11-28 20:22:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12994 to 9608. [2018-11-28 20:22:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-11-28 20:22:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 21410 transitions. [2018-11-28 20:22:54,845 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 21410 transitions. Word has length 95 [2018-11-28 20:22:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:54,845 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 21410 transitions. [2018-11-28 20:22:54,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 20:22:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 21410 transitions. [2018-11-28 20:22:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:22:54,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:54,857 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] [2018-11-28 20:22:54,858 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:54,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash 459703696, now seen corresponding path program 1 times [2018-11-28 20:22:54,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:54,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:54,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:54,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:54,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:55,145 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:22:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:55,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:55,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:22:55,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:22:55,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:22:55,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:22:55,222 INFO L87 Difference]: Start difference. First operand 9608 states and 21410 transitions. Second operand 11 states. [2018-11-28 20:22:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:57,072 INFO L93 Difference]: Finished difference Result 18046 states and 40435 transitions. [2018-11-28 20:22:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:22:57,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-11-28 20:22:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:57,092 INFO L225 Difference]: With dead ends: 18046 [2018-11-28 20:22:57,093 INFO L226 Difference]: Without dead ends: 12348 [2018-11-28 20:22:57,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-28 20:22:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12348 states. [2018-11-28 20:22:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12348 to 9338. [2018-11-28 20:22:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2018-11-28 20:22:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 20791 transitions. [2018-11-28 20:22:57,203 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 20791 transitions. Word has length 95 [2018-11-28 20:22:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:57,203 INFO L480 AbstractCegarLoop]: Abstraction has 9338 states and 20791 transitions. [2018-11-28 20:22:57,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:22:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 20791 transitions. [2018-11-28 20:22:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:22:57,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:57,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:22:57,214 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:57,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2021940000, now seen corresponding path program 1 times [2018-11-28 20:22:57,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:57,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:57,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:57,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:57,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:22:57,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:22:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:22:57,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:22:57,942 INFO L87 Difference]: Start difference. First operand 9338 states and 20791 transitions. Second operand 7 states. [2018-11-28 20:22:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:58,499 INFO L93 Difference]: Finished difference Result 10983 states and 24188 transitions. [2018-11-28 20:22:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:22:58,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-11-28 20:22:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:58,515 INFO L225 Difference]: With dead ends: 10983 [2018-11-28 20:22:58,516 INFO L226 Difference]: Without dead ends: 10940 [2018-11-28 20:22:58,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:22:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10940 states. [2018-11-28 20:22:58,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10940 to 9660. [2018-11-28 20:22:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9660 states. [2018-11-28 20:22:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9660 states to 9660 states and 21408 transitions. [2018-11-28 20:22:58,632 INFO L78 Accepts]: Start accepts. Automaton has 9660 states and 21408 transitions. Word has length 95 [2018-11-28 20:22:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:58,633 INFO L480 AbstractCegarLoop]: Abstraction has 9660 states and 21408 transitions. [2018-11-28 20:22:58,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:22:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 9660 states and 21408 transitions. [2018-11-28 20:22:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:22:58,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:58,644 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] [2018-11-28 20:22:58,644 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:58,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:58,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1685469248, now seen corresponding path program 2 times [2018-11-28 20:22:58,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:58,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:58,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:22:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:22:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:22:59,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:22:59,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:22:59,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:22:59,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:22:59,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:22:59,284 INFO L87 Difference]: Start difference. First operand 9660 states and 21408 transitions. Second operand 7 states. [2018-11-28 20:22:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:22:59,819 INFO L93 Difference]: Finished difference Result 13423 states and 29205 transitions. [2018-11-28 20:22:59,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:22:59,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-11-28 20:22:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:22:59,836 INFO L225 Difference]: With dead ends: 13423 [2018-11-28 20:22:59,837 INFO L226 Difference]: Without dead ends: 13423 [2018-11-28 20:22:59,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:22:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13423 states. [2018-11-28 20:22:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13423 to 10567. [2018-11-28 20:22:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10567 states. [2018-11-28 20:22:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10567 states to 10567 states and 23476 transitions. [2018-11-28 20:22:59,971 INFO L78 Accepts]: Start accepts. Automaton has 10567 states and 23476 transitions. Word has length 95 [2018-11-28 20:22:59,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:22:59,972 INFO L480 AbstractCegarLoop]: Abstraction has 10567 states and 23476 transitions. [2018-11-28 20:22:59,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:22:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 10567 states and 23476 transitions. [2018-11-28 20:22:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:22:59,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:22:59,984 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] [2018-11-28 20:22:59,985 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:22:59,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:22:59,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1009316480, now seen corresponding path program 1 times [2018-11-28 20:22:59,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:22:59,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:22:59,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:59,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:22:59,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:22:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:23:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:23:00,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:23:00,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:23:00,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:23:00,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:23:00,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:23:00,491 INFO L87 Difference]: Start difference. First operand 10567 states and 23476 transitions. Second operand 6 states. [2018-11-28 20:23:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:23:00,793 INFO L93 Difference]: Finished difference Result 10913 states and 24029 transitions. [2018-11-28 20:23:00,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:23:00,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-11-28 20:23:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:23:00,808 INFO L225 Difference]: With dead ends: 10913 [2018-11-28 20:23:00,809 INFO L226 Difference]: Without dead ends: 10913 [2018-11-28 20:23:00,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:23:00,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2018-11-28 20:23:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 10221. [2018-11-28 20:23:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10221 states. [2018-11-28 20:23:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10221 states to 10221 states and 22603 transitions. [2018-11-28 20:23:00,927 INFO L78 Accepts]: Start accepts. Automaton has 10221 states and 22603 transitions. Word has length 95 [2018-11-28 20:23:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:23:00,927 INFO L480 AbstractCegarLoop]: Abstraction has 10221 states and 22603 transitions. [2018-11-28 20:23:00,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:23:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 10221 states and 22603 transitions. [2018-11-28 20:23:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:23:00,939 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:23:00,939 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] [2018-11-28 20:23:00,940 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:23:00,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:23:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1943261535, now seen corresponding path program 2 times [2018-11-28 20:23:00,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:23:00,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:23:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:23:00,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:23:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:23:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:23:01,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-11-28 20:23:01,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:23:01,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:23:01,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:23:01,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:23:01,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:23:01,265 INFO L87 Difference]: Start difference. First operand 10221 states and 22603 transitions. Second operand 8 states. [2018-11-28 20:23:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:23:01,766 INFO L93 Difference]: Finished difference Result 13242 states and 28942 transitions. [2018-11-28 20:23:01,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:23:01,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-11-28 20:23:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:23:01,784 INFO L225 Difference]: With dead ends: 13242 [2018-11-28 20:23:01,784 INFO L226 Difference]: Without dead ends: 13242 [2018-11-28 20:23:01,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:23:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13242 states. [2018-11-28 20:23:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13242 to 10350. [2018-11-28 20:23:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10350 states. [2018-11-28 20:23:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10350 states to 10350 states and 22918 transitions. [2018-11-28 20:23:01,920 INFO L78 Accepts]: Start accepts. Automaton has 10350 states and 22918 transitions. Word has length 95 [2018-11-28 20:23:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:23:01,920 INFO L480 AbstractCegarLoop]: Abstraction has 10350 states and 22918 transitions. [2018-11-28 20:23:01,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:23:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 10350 states and 22918 transitions. [2018-11-28 20:23:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:23:01,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:23:01,933 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] [2018-11-28 20:23:01,933 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:23:01,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:23:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1675552993, now seen corresponding path program 2 times [2018-11-28 20:23:01,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:23:01,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:23:01,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:23:01,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:23:01,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:23:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:23:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:23:02,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:23:02,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:23:02,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:23:02,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:23:02,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:23:02,157 INFO L87 Difference]: Start difference. First operand 10350 states and 22918 transitions. Second operand 5 states. [2018-11-28 20:23:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:23:02,224 INFO L93 Difference]: Finished difference Result 10350 states and 22854 transitions. [2018-11-28 20:23:02,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:23:02,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-11-28 20:23:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:23:02,239 INFO L225 Difference]: With dead ends: 10350 [2018-11-28 20:23:02,239 INFO L226 Difference]: Without dead ends: 10350 [2018-11-28 20:23:02,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:23:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10350 states. [2018-11-28 20:23:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10350 to 6943. [2018-11-28 20:23:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6943 states. [2018-11-28 20:23:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6943 states to 6943 states and 15321 transitions. [2018-11-28 20:23:02,341 INFO L78 Accepts]: Start accepts. Automaton has 6943 states and 15321 transitions. Word has length 95 [2018-11-28 20:23:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:23:02,341 INFO L480 AbstractCegarLoop]: Abstraction has 6943 states and 15321 transitions. [2018-11-28 20:23:02,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:23:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 6943 states and 15321 transitions. [2018-11-28 20:23:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 20:23:02,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:23:02,350 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] [2018-11-28 20:23:02,350 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:23:02,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:23:02,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1731910622, now seen corresponding path program 2 times [2018-11-28 20:23:02,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:23:02,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:23:02,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:23:02,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:23:02,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:23:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:23:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:23:02,480 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:23:02,675 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:23:02,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:23:02 BasicIcfg [2018-11-28 20:23:02,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:23:02,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:23:02,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:23:02,684 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:23:02,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:12" (3/4) ... [2018-11-28 20:23:02,690 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:23:02,906 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:23:02,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:23:02,911 INFO L168 Benchmark]: Toolchain (without parser) took 52914.54 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 20:23:02,913 INFO L168 Benchmark]: CDTParser took 0.21 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-11-28 20:23:02,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 860.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-11-28 20:23:02,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:23:02,914 INFO L168 Benchmark]: Boogie Preprocessor took 45.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:23:02,915 INFO L168 Benchmark]: RCFGBuilder took 1279.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:23:02,920 INFO L168 Benchmark]: TraceAbstraction took 50424.30 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -97.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-28 20:23:02,920 INFO L168 Benchmark]: Witness Printer took 226.90 ms. Allocated memory is still 2.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. [2018-11-28 20:23:02,927 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.21 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 860.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1279.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50424.30 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -97.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 226.90 ms. Allocated memory is still 2.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [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] [L696] -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] [L697] -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] [L773] -1 pthread_t t1713; 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] [L774] FCALL, FORK -1 pthread_create(&t1713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L701] 0 x$w_buff1 = x$w_buff0 [L702] 0 x$w_buff0 = 1 [L703] 0 x$w_buff1_used = x$w_buff0_used [L704] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L707] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L708] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L709] 0 x$r_buff0_thd1 = (_Bool)1 [L712] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L715] EXPR 0 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=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 pthread_t t1714; 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] FCALL, FORK -1 pthread_create(&t1714, ((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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L729] 1 y = 2 [L732] 1 __unbuffered_p1_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L717] EXPR 0 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 0 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 [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L719] EXPR 0 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 0 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 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] EXPR 1 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L753] 1 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 [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L755] EXPR 1 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 1 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 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 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=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 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=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] -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) [L783] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L784] 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=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -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 [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L786] 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=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -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 [L789] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 50.2s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 27.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9244 SDtfs, 10828 SDslu, 23724 SDs, 0 SdLazy, 11566 SolverSat, 554 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 96 SyntacticMatches, 45 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34806occurred in iteration=0, 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: 8.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 98509 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 2859 NumberOfCodeBlocks, 2859 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2728 ConstructedInterpolants, 0 QuantifiedInterpolants, 665849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...