./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi001_pso.oepc_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/rfi001_pso.oepc_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 c1f9c3d1c44dc25378b363cd225ab320ff5e52b6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:19:29,818 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:19:29,820 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:19:29,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:19:29,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:19:29,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:19:29,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:19:29,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:19:29,839 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:19:29,840 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:19:29,841 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:19:29,841 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:19:29,842 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:19:29,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:19:29,845 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:19:29,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:19:29,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:19:29,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:19:29,851 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:19:29,853 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:19:29,854 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:19:29,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:19:29,859 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:19:29,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:19:29,859 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:19:29,860 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:19:29,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:19:29,863 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:19:29,864 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:19:29,865 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:19:29,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:19:29,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:19:29,866 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:19:29,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:19:29,868 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:19:29,869 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:19:29,869 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:19:29,898 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:19:29,898 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:19:29,899 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:19:29,899 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:19:29,901 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:19:29,901 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:19:29,902 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:19:29,903 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:19:29,903 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:19:29,903 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:19:29,903 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:19:29,904 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:19:29,904 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:19:29,904 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:19:29,904 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:19:29,904 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:19:29,905 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:19:29,905 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:19:29,905 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:19:29,905 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:19:29,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:19:29,905 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:19:29,909 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:19:29,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:19:29,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:19:29,909 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:19:29,909 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:19:29,910 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:19:29,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:19:29,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:19:29,910 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 -> c1f9c3d1c44dc25378b363cd225ab320ff5e52b6 [2018-11-28 20:19:29,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:19:29,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:19:29,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:19:29,990 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:19:29,992 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:19:29,992 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi001_pso.oepc_false-unreach-call.i [2018-11-28 20:19:30,052 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74e917ab/a93c19064af4431d84f0fbc236487e38/FLAG50508675a [2018-11-28 20:19:30,643 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:19:30,644 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi001_pso.oepc_false-unreach-call.i [2018-11-28 20:19:30,665 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74e917ab/a93c19064af4431d84f0fbc236487e38/FLAG50508675a [2018-11-28 20:19:30,892 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74e917ab/a93c19064af4431d84f0fbc236487e38 [2018-11-28 20:19:30,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:19:30,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:19:30,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:19:30,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:19:30,905 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:19:30,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:30" (1/1) ... [2018-11-28 20:19:30,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19899a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:30, skipping insertion in model container [2018-11-28 20:19:30,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:30" (1/1) ... [2018-11-28 20:19:30,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:19:30,985 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:19:31,526 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:19:31,554 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:19:31,752 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:19:31,836 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:19:31,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:31 WrapperNode [2018-11-28 20:19:31,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:19:31,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:19:31,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:19:31,838 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:19:31,850 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:19:31" (1/1) ... [2018-11-28 20:19:31,886 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:19:31" (1/1) ... [2018-11-28 20:19:31,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:19:31,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:19:31,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:19:31,938 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:19:31,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:31" (1/1) ... [2018-11-28 20:19:31,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:31" (1/1) ... [2018-11-28 20:19:31,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:31" (1/1) ... [2018-11-28 20:19:31,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:31" (1/1) ... [2018-11-28 20:19:31,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:31" (1/1) ... [2018-11-28 20:19:31,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:31" (1/1) ... [2018-11-28 20:19:31,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:31" (1/1) ... [2018-11-28 20:19:31,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:19:31,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:19:31,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:19:31,987 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:19:31,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:31" (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:19:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:19:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:19:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:19:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:19:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:19:32,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:19:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:19:32,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:19:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:19:32,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:19:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:19:32,096 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:19:33,378 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:19:33,379 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:19:33,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:33 BoogieIcfgContainer [2018-11-28 20:19:33,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:19:33,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:19:33,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:19:33,385 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:19:33,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:19:30" (1/3) ... [2018-11-28 20:19:33,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab27dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:33, skipping insertion in model container [2018-11-28 20:19:33,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:31" (2/3) ... [2018-11-28 20:19:33,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab27dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:33, skipping insertion in model container [2018-11-28 20:19:33,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:33" (3/3) ... [2018-11-28 20:19:33,389 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_pso.oepc_false-unreach-call.i [2018-11-28 20:19:33,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,442 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,442 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,442 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,443 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,443 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:19:33,443 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,444 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,449 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,450 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,451 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,454 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,454 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,458 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,461 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,469 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,476 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:19:33,508 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:19:33,508 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:19:33,517 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:19:33,535 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:19:33,564 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:19:33,565 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:19:33,565 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:19:33,565 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:19:33,565 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:19:33,565 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:19:33,566 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:19:33,566 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:19:33,566 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:19:33,581 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-11-28 20:19:36,277 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-11-28 20:19:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-11-28 20:19:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 20:19:36,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:36,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:36,292 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:36,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:36,299 INFO L82 PathProgramCache]: Analyzing trace with hash 314479455, now seen corresponding path program 1 times [2018-11-28 20:19:36,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:36,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:36,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:36,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:19:36,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:36,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:19:36,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:19:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:19:36,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:19:36,689 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-11-28 20:19:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:38,210 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-11-28 20:19:38,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:19:38,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-28 20:19:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:38,628 INFO L225 Difference]: With dead ends: 60791 [2018-11-28 20:19:38,628 INFO L226 Difference]: Without dead ends: 44271 [2018-11-28 20:19:38,630 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:19:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-11-28 20:19:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-11-28 20:19:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-11-28 20:19:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-11-28 20:19:40,474 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-11-28 20:19:40,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:40,477 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-11-28 20:19:40,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:19:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-11-28 20:19:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 20:19:40,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:40,497 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:19:40,497 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:40,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:40,498 INFO L82 PathProgramCache]: Analyzing trace with hash -494436635, now seen corresponding path program 1 times [2018-11-28 20:19:40,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:40,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:40,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:40,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:40,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:40,638 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:19:40,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:40,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:19:40,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:19:40,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:19:40,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:19:40,642 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 3 states. [2018-11-28 20:19:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:41,211 INFO L93 Difference]: Finished difference Result 27339 states and 105223 transitions. [2018-11-28 20:19:41,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:19:41,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-28 20:19:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:41,325 INFO L225 Difference]: With dead ends: 27339 [2018-11-28 20:19:41,325 INFO L226 Difference]: Without dead ends: 27339 [2018-11-28 20:19:41,327 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:19:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2018-11-28 20:19:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 27339. [2018-11-28 20:19:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-11-28 20:19:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105223 transitions. [2018-11-28 20:19:42,658 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105223 transitions. Word has length 46 [2018-11-28 20:19:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:42,659 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105223 transitions. [2018-11-28 20:19:42,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:19:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105223 transitions. [2018-11-28 20:19:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 20:19:42,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:42,665 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:19:42,665 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:42,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1248373700, now seen corresponding path program 1 times [2018-11-28 20:19:42,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:42,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:42,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:42,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:42,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:19:42,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:42,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:19:42,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:19:42,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:19:42,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:19:42,787 INFO L87 Difference]: Start difference. First operand 27339 states and 105223 transitions. Second operand 4 states. [2018-11-28 20:19:42,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:42,914 INFO L93 Difference]: Finished difference Result 8529 states and 28321 transitions. [2018-11-28 20:19:42,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:19:42,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-28 20:19:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:42,961 INFO L225 Difference]: With dead ends: 8529 [2018-11-28 20:19:42,961 INFO L226 Difference]: Without dead ends: 7467 [2018-11-28 20:19:42,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:19:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2018-11-28 20:19:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7467. [2018-11-28 20:19:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7467 states. [2018-11-28 20:19:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 24613 transitions. [2018-11-28 20:19:43,138 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 24613 transitions. Word has length 46 [2018-11-28 20:19:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:43,138 INFO L480 AbstractCegarLoop]: Abstraction has 7467 states and 24613 transitions. [2018-11-28 20:19:43,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:19:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 24613 transitions. [2018-11-28 20:19:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 20:19:43,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:43,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:43,142 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:43,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:43,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1026875031, now seen corresponding path program 1 times [2018-11-28 20:19:43,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:43,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:43,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:43,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:43,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:43,429 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:19:43,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:43,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:19:43,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:19:43,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:19:43,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:19:43,431 INFO L87 Difference]: Start difference. First operand 7467 states and 24613 transitions. Second operand 5 states. [2018-11-28 20:19:44,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:44,401 INFO L93 Difference]: Finished difference Result 13999 states and 45774 transitions. [2018-11-28 20:19:44,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:19:44,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-28 20:19:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:44,469 INFO L225 Difference]: With dead ends: 13999 [2018-11-28 20:19:44,470 INFO L226 Difference]: Without dead ends: 13931 [2018-11-28 20:19:44,470 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:19:44,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13931 states. [2018-11-28 20:19:44,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13931 to 9442. [2018-11-28 20:19:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9442 states. [2018-11-28 20:19:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9442 states to 9442 states and 30519 transitions. [2018-11-28 20:19:44,750 INFO L78 Accepts]: Start accepts. Automaton has 9442 states and 30519 transitions. Word has length 47 [2018-11-28 20:19:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:44,751 INFO L480 AbstractCegarLoop]: Abstraction has 9442 states and 30519 transitions. [2018-11-28 20:19:44,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:19:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 9442 states and 30519 transitions. [2018-11-28 20:19:44,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 20:19:44,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:44,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:44,755 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:44,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:44,755 INFO L82 PathProgramCache]: Analyzing trace with hash -43389411, now seen corresponding path program 1 times [2018-11-28 20:19:44,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:44,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:44,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:44,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:44,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:44,881 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:19:44,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:44,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:19:44,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:19:44,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:19:44,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:19:44,884 INFO L87 Difference]: Start difference. First operand 9442 states and 30519 transitions. Second operand 3 states. [2018-11-28 20:19:45,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:45,112 INFO L93 Difference]: Finished difference Result 13280 states and 42594 transitions. [2018-11-28 20:19:45,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:19:45,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-28 20:19:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:45,147 INFO L225 Difference]: With dead ends: 13280 [2018-11-28 20:19:45,147 INFO L226 Difference]: Without dead ends: 13280 [2018-11-28 20:19:45,148 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:19:45,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13280 states. [2018-11-28 20:19:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13280 to 9846. [2018-11-28 20:19:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9846 states. [2018-11-28 20:19:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 31485 transitions. [2018-11-28 20:19:45,459 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 31485 transitions. Word has length 49 [2018-11-28 20:19:45,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:45,460 INFO L480 AbstractCegarLoop]: Abstraction has 9846 states and 31485 transitions. [2018-11-28 20:19:45,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:19:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 31485 transitions. [2018-11-28 20:19:45,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 20:19:45,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:45,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:45,464 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:45,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash -431668952, now seen corresponding path program 1 times [2018-11-28 20:19:45,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:45,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:45,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:45,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:45,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:45,697 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:19:45,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:45,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:19:45,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:19:45,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:19:45,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:19:45,700 INFO L87 Difference]: Start difference. First operand 9846 states and 31485 transitions. Second operand 6 states. [2018-11-28 20:19:46,323 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-28 20:19:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:46,909 INFO L93 Difference]: Finished difference Result 14204 states and 45033 transitions. [2018-11-28 20:19:46,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:19:46,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-11-28 20:19:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:46,942 INFO L225 Difference]: With dead ends: 14204 [2018-11-28 20:19:46,942 INFO L226 Difference]: Without dead ends: 14132 [2018-11-28 20:19:46,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:19:46,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14132 states. [2018-11-28 20:19:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14132 to 10850. [2018-11-28 20:19:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10850 states. [2018-11-28 20:19:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10850 states to 10850 states and 34540 transitions. [2018-11-28 20:19:47,219 INFO L78 Accepts]: Start accepts. Automaton has 10850 states and 34540 transitions. Word has length 53 [2018-11-28 20:19:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:47,219 INFO L480 AbstractCegarLoop]: Abstraction has 10850 states and 34540 transitions. [2018-11-28 20:19:47,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:19:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 10850 states and 34540 transitions. [2018-11-28 20:19:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 20:19:47,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:47,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:47,227 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:47,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash -488484476, now seen corresponding path program 1 times [2018-11-28 20:19:47,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:47,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:47,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:47,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:47,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:47,431 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:19:47,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:47,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:19:47,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:19:47,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:19:47,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:19:47,432 INFO L87 Difference]: Start difference. First operand 10850 states and 34540 transitions. Second operand 4 states. [2018-11-28 20:19:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:47,593 INFO L93 Difference]: Finished difference Result 12397 states and 39549 transitions. [2018-11-28 20:19:47,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:19:47,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-11-28 20:19:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:47,615 INFO L225 Difference]: With dead ends: 12397 [2018-11-28 20:19:47,615 INFO L226 Difference]: Without dead ends: 12397 [2018-11-28 20:19:47,616 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:19:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2018-11-28 20:19:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 11370. [2018-11-28 20:19:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11370 states. [2018-11-28 20:19:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11370 states to 11370 states and 36213 transitions. [2018-11-28 20:19:47,816 INFO L78 Accepts]: Start accepts. Automaton has 11370 states and 36213 transitions. Word has length 61 [2018-11-28 20:19:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:47,816 INFO L480 AbstractCegarLoop]: Abstraction has 11370 states and 36213 transitions. [2018-11-28 20:19:47,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:19:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 11370 states and 36213 transitions. [2018-11-28 20:19:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 20:19:47,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:47,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:47,824 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:47,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1254325859, now seen corresponding path program 1 times [2018-11-28 20:19:47,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:47,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:47,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:47,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:47,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:48,216 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:19:48,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:48,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:19:48,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:19:48,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:19:48,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:19:48,218 INFO L87 Difference]: Start difference. First operand 11370 states and 36213 transitions. Second operand 6 states. [2018-11-28 20:19:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:49,141 INFO L93 Difference]: Finished difference Result 20970 states and 66431 transitions. [2018-11-28 20:19:49,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:19:49,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-28 20:19:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:49,183 INFO L225 Difference]: With dead ends: 20970 [2018-11-28 20:19:49,183 INFO L226 Difference]: Without dead ends: 20899 [2018-11-28 20:19:49,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:19:49,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20899 states. [2018-11-28 20:19:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20899 to 13756. [2018-11-28 20:19:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2018-11-28 20:19:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 43245 transitions. [2018-11-28 20:19:49,467 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 43245 transitions. Word has length 61 [2018-11-28 20:19:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:49,467 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 43245 transitions. [2018-11-28 20:19:49,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:19:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 43245 transitions. [2018-11-28 20:19:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:19:49,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:49,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:49,478 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:49,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash 593414934, now seen corresponding path program 1 times [2018-11-28 20:19:49,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:49,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:49,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:49,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:49,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:49,607 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:19:49,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:49,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:19:49,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:19:49,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:19:49,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:19:49,610 INFO L87 Difference]: Start difference. First operand 13756 states and 43245 transitions. Second operand 3 states. [2018-11-28 20:19:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:50,007 INFO L93 Difference]: Finished difference Result 14388 states and 44945 transitions. [2018-11-28 20:19:50,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:19:50,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-11-28 20:19:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:50,412 INFO L225 Difference]: With dead ends: 14388 [2018-11-28 20:19:50,413 INFO L226 Difference]: Without dead ends: 14388 [2018-11-28 20:19:50,413 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:19:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14388 states. [2018-11-28 20:19:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14388 to 14072. [2018-11-28 20:19:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14072 states. [2018-11-28 20:19:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 44095 transitions. [2018-11-28 20:19:50,647 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 44095 transitions. Word has length 65 [2018-11-28 20:19:50,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:50,648 INFO L480 AbstractCegarLoop]: Abstraction has 14072 states and 44095 transitions. [2018-11-28 20:19:50,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:19:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 44095 transitions. [2018-11-28 20:19:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:19:50,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:50,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:50,659 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:50,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1624343019, now seen corresponding path program 1 times [2018-11-28 20:19:50,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:50,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:50,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:50,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:50,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:50,809 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:19:50,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:50,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:19:50,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:19:50,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:19:50,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:19:50,810 INFO L87 Difference]: Start difference. First operand 14072 states and 44095 transitions. Second operand 4 states. [2018-11-28 20:19:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:51,427 INFO L93 Difference]: Finished difference Result 17952 states and 55400 transitions. [2018-11-28 20:19:51,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:19:51,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-28 20:19:51,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:51,460 INFO L225 Difference]: With dead ends: 17952 [2018-11-28 20:19:51,460 INFO L226 Difference]: Without dead ends: 17952 [2018-11-28 20:19:51,461 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:19:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2018-11-28 20:19:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 16110. [2018-11-28 20:19:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16110 states. [2018-11-28 20:19:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16110 states to 16110 states and 49946 transitions. [2018-11-28 20:19:51,705 INFO L78 Accepts]: Start accepts. Automaton has 16110 states and 49946 transitions. Word has length 65 [2018-11-28 20:19:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:51,706 INFO L480 AbstractCegarLoop]: Abstraction has 16110 states and 49946 transitions. [2018-11-28 20:19:51,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:19:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 16110 states and 49946 transitions. [2018-11-28 20:19:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:19:51,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:51,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:51,719 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:51,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:51,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1085072735, now seen corresponding path program 1 times [2018-11-28 20:19:51,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:51,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:51,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:51,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:51,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:19:52,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:52,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:19:52,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:19:52,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:19:52,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:19:52,095 INFO L87 Difference]: Start difference. First operand 16110 states and 49946 transitions. Second operand 6 states. [2018-11-28 20:19:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:53,361 INFO L93 Difference]: Finished difference Result 19822 states and 60382 transitions. [2018-11-28 20:19:53,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:19:53,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-28 20:19:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:53,406 INFO L225 Difference]: With dead ends: 19822 [2018-11-28 20:19:53,406 INFO L226 Difference]: Without dead ends: 19822 [2018-11-28 20:19:53,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:19:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19822 states. [2018-11-28 20:19:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19822 to 18618. [2018-11-28 20:19:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18618 states. [2018-11-28 20:19:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 57170 transitions. [2018-11-28 20:19:53,764 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 57170 transitions. Word has length 67 [2018-11-28 20:19:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:53,764 INFO L480 AbstractCegarLoop]: Abstraction has 18618 states and 57170 transitions. [2018-11-28 20:19:53,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:19:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 57170 transitions. [2018-11-28 20:19:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:19:53,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:53,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:53,779 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:53,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:53,779 INFO L82 PathProgramCache]: Analyzing trace with hash -992136608, now seen corresponding path program 1 times [2018-11-28 20:19:53,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:53,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:53,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:53,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:53,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:54,196 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:19:54,473 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-11-28 20:19:54,481 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:19:54,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:54,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:19:54,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:19:54,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:19:54,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:19:54,483 INFO L87 Difference]: Start difference. First operand 18618 states and 57170 transitions. Second operand 6 states. [2018-11-28 20:19:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:55,466 INFO L93 Difference]: Finished difference Result 21450 states and 63579 transitions. [2018-11-28 20:19:55,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:19:55,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-28 20:19:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:55,507 INFO L225 Difference]: With dead ends: 21450 [2018-11-28 20:19:55,507 INFO L226 Difference]: Without dead ends: 21450 [2018-11-28 20:19:55,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:19:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21450 states. [2018-11-28 20:19:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21450 to 19134. [2018-11-28 20:19:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19134 states. [2018-11-28 20:19:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19134 states to 19134 states and 57717 transitions. [2018-11-28 20:19:55,870 INFO L78 Accepts]: Start accepts. Automaton has 19134 states and 57717 transitions. Word has length 67 [2018-11-28 20:19:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:55,870 INFO L480 AbstractCegarLoop]: Abstraction has 19134 states and 57717 transitions. [2018-11-28 20:19:55,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:19:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 19134 states and 57717 transitions. [2018-11-28 20:19:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:19:55,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:55,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:55,885 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:55,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:55,885 INFO L82 PathProgramCache]: Analyzing trace with hash -780785695, now seen corresponding path program 1 times [2018-11-28 20:19:55,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:55,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:55,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:55,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:56,012 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:19:56,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:56,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:19:56,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:19:56,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:19:56,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:19:56,014 INFO L87 Difference]: Start difference. First operand 19134 states and 57717 transitions. Second operand 5 states. [2018-11-28 20:19:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:56,738 INFO L93 Difference]: Finished difference Result 25025 states and 74971 transitions. [2018-11-28 20:19:56,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:19:56,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 20:19:56,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:56,789 INFO L225 Difference]: With dead ends: 25025 [2018-11-28 20:19:56,790 INFO L226 Difference]: Without dead ends: 25025 [2018-11-28 20:19:56,790 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:19:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2018-11-28 20:19:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 22710. [2018-11-28 20:19:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22710 states. [2018-11-28 20:19:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22710 states to 22710 states and 67985 transitions. [2018-11-28 20:19:57,512 INFO L78 Accepts]: Start accepts. Automaton has 22710 states and 67985 transitions. Word has length 67 [2018-11-28 20:19:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:57,512 INFO L480 AbstractCegarLoop]: Abstraction has 22710 states and 67985 transitions. [2018-11-28 20:19:57,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:19:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 22710 states and 67985 transitions. [2018-11-28 20:19:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:19:57,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:57,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:57,525 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:57,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1291319872, now seen corresponding path program 1 times [2018-11-28 20:19:57,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:57,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:57,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:57,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:57,649 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:19:57,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:57,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:19:57,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:19:57,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:19:57,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:19:57,650 INFO L87 Difference]: Start difference. First operand 22710 states and 67985 transitions. Second operand 5 states. [2018-11-28 20:19:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:58,321 INFO L93 Difference]: Finished difference Result 31960 states and 94824 transitions. [2018-11-28 20:19:58,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:19:58,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 20:19:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:58,378 INFO L225 Difference]: With dead ends: 31960 [2018-11-28 20:19:58,379 INFO L226 Difference]: Without dead ends: 31960 [2018-11-28 20:19:58,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:19:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31960 states. [2018-11-28 20:19:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31960 to 28240. [2018-11-28 20:19:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28240 states. [2018-11-28 20:19:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28240 states to 28240 states and 84212 transitions. [2018-11-28 20:19:58,893 INFO L78 Accepts]: Start accepts. Automaton has 28240 states and 84212 transitions. Word has length 67 [2018-11-28 20:19:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:19:58,893 INFO L480 AbstractCegarLoop]: Abstraction has 28240 states and 84212 transitions. [2018-11-28 20:19:58,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:19:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 28240 states and 84212 transitions. [2018-11-28 20:19:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:19:58,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:19:58,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:19:58,909 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:19:58,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:19:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1196192961, now seen corresponding path program 1 times [2018-11-28 20:19:58,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:19:58,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:19:58,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:58,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:19:58,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:19:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:19:59,103 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:19:59,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:19:59,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:19:59,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:19:59,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:19:59,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:19:59,104 INFO L87 Difference]: Start difference. First operand 28240 states and 84212 transitions. Second operand 4 states. [2018-11-28 20:19:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:19:59,849 INFO L93 Difference]: Finished difference Result 38784 states and 116172 transitions. [2018-11-28 20:19:59,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:19:59,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-28 20:19:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:19:59,922 INFO L225 Difference]: With dead ends: 38784 [2018-11-28 20:19:59,922 INFO L226 Difference]: Without dead ends: 38552 [2018-11-28 20:19:59,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:19:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38552 states. [2018-11-28 20:20:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38552 to 35692. [2018-11-28 20:20:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35692 states. [2018-11-28 20:20:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35692 states to 35692 states and 106997 transitions. [2018-11-28 20:20:00,546 INFO L78 Accepts]: Start accepts. Automaton has 35692 states and 106997 transitions. Word has length 67 [2018-11-28 20:20:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:00,546 INFO L480 AbstractCegarLoop]: Abstraction has 35692 states and 106997 transitions. [2018-11-28 20:20:00,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 35692 states and 106997 transitions. [2018-11-28 20:20:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:20:00,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:00,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:00,564 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:00,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:00,564 INFO L82 PathProgramCache]: Analyzing trace with hash -600758398, now seen corresponding path program 1 times [2018-11-28 20:20:00,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:00,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:00,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:00,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:00,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:00,708 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:20:00,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:00,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:00,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:00,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:00,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:00,709 INFO L87 Difference]: Start difference. First operand 35692 states and 106997 transitions. Second operand 5 states. [2018-11-28 20:20:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:00,780 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2018-11-28 20:20:00,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:20:00,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 20:20:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:00,792 INFO L225 Difference]: With dead ends: 9316 [2018-11-28 20:20:00,792 INFO L226 Difference]: Without dead ends: 7464 [2018-11-28 20:20:00,793 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:20:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2018-11-28 20:20:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2018-11-28 20:20:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2018-11-28 20:20:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2018-11-28 20:20:00,877 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2018-11-28 20:20:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:00,877 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2018-11-28 20:20:00,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2018-11-28 20:20:00,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 20:20:00,887 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:00,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:00,887 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:00,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:00,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1144549580, now seen corresponding path program 1 times [2018-11-28 20:20:00,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:00,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:00,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:00,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:00,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:00,972 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:20:00,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:00,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:20:00,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:20:00,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:20:00,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:00,973 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2018-11-28 20:20:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:01,107 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2018-11-28 20:20:01,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:20:01,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-11-28 20:20:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:01,118 INFO L225 Difference]: With dead ends: 8820 [2018-11-28 20:20:01,119 INFO L226 Difference]: Without dead ends: 8820 [2018-11-28 20:20:01,119 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:20:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2018-11-28 20:20:01,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2018-11-28 20:20:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2018-11-28 20:20:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2018-11-28 20:20:01,244 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2018-11-28 20:20:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:01,244 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2018-11-28 20:20:01,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:20:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2018-11-28 20:20:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 20:20:01,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:01,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:01,254 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:01,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1467487719, now seen corresponding path program 1 times [2018-11-28 20:20:01,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:01,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:01,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:01,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:01,393 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:20:01,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:01,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:01,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:01,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:01,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:01,394 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2018-11-28 20:20:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:01,671 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2018-11-28 20:20:01,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:20:01,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-28 20:20:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:01,682 INFO L225 Difference]: With dead ends: 7470 [2018-11-28 20:20:01,682 INFO L226 Difference]: Without dead ends: 7470 [2018-11-28 20:20:01,682 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:20:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-11-28 20:20:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2018-11-28 20:20:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2018-11-28 20:20:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2018-11-28 20:20:01,766 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2018-11-28 20:20:01,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:01,766 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2018-11-28 20:20:01,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2018-11-28 20:20:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 20:20:01,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:01,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:01,773 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:01,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:01,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1084669242, now seen corresponding path program 1 times [2018-11-28 20:20:01,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:01,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:01,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:01,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:01,933 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:20:01,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:01,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:01,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:01,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:01,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:01,935 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2018-11-28 20:20:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:02,438 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2018-11-28 20:20:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:20:02,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-11-28 20:20:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:02,450 INFO L225 Difference]: With dead ends: 7881 [2018-11-28 20:20:02,450 INFO L226 Difference]: Without dead ends: 7762 [2018-11-28 20:20:02,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-11-28 20:20:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2018-11-28 20:20:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2018-11-28 20:20:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-11-28 20:20:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2018-11-28 20:20:02,540 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2018-11-28 20:20:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:02,540 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2018-11-28 20:20:02,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2018-11-28 20:20:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:20:02,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:02,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:02,550 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:02,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:02,550 INFO L82 PathProgramCache]: Analyzing trace with hash -604903176, now seen corresponding path program 1 times [2018-11-28 20:20:02,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:02,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:02,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:02,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:20:02,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:02,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:02,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:02,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:02,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:02,767 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2018-11-28 20:20:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:03,270 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2018-11-28 20:20:03,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:20:03,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-28 20:20:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:03,285 INFO L225 Difference]: With dead ends: 10608 [2018-11-28 20:20:03,285 INFO L226 Difference]: Without dead ends: 10608 [2018-11-28 20:20:03,285 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:20:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2018-11-28 20:20:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2018-11-28 20:20:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2018-11-28 20:20:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2018-11-28 20:20:03,390 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2018-11-28 20:20:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:03,390 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2018-11-28 20:20:03,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2018-11-28 20:20:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:20:03,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:03,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:03,401 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:03,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:03,401 INFO L82 PathProgramCache]: Analyzing trace with hash 618517018, now seen corresponding path program 2 times [2018-11-28 20:20:03,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:03,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:03,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:03,580 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:20:03,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:03,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:20:03,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:20:03,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:20:03,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:20:03,582 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2018-11-28 20:20:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:03,706 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2018-11-28 20:20:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:20:03,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-28 20:20:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:03,718 INFO L225 Difference]: With dead ends: 8526 [2018-11-28 20:20:03,718 INFO L226 Difference]: Without dead ends: 8526 [2018-11-28 20:20:03,718 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:20:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-11-28 20:20:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2018-11-28 20:20:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2018-11-28 20:20:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2018-11-28 20:20:03,810 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2018-11-28 20:20:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:03,811 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2018-11-28 20:20:03,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:20:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2018-11-28 20:20:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:20:03,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:03,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:03,821 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:03,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1465486910, now seen corresponding path program 1 times [2018-11-28 20:20:03,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:03,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:03,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:20:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:04,084 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:20:04,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:04,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:04,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:04,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:04,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:04,088 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 7 states. [2018-11-28 20:20:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:04,709 INFO L93 Difference]: Finished difference Result 9705 states and 21992 transitions. [2018-11-28 20:20:04,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:04,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-11-28 20:20:04,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:04,723 INFO L225 Difference]: With dead ends: 9705 [2018-11-28 20:20:04,723 INFO L226 Difference]: Without dead ends: 9705 [2018-11-28 20:20:04,723 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:20:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2018-11-28 20:20:04,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 7979. [2018-11-28 20:20:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7979 states. [2018-11-28 20:20:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 18204 transitions. [2018-11-28 20:20:04,822 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 18204 transitions. Word has length 94 [2018-11-28 20:20:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:04,822 INFO L480 AbstractCegarLoop]: Abstraction has 7979 states and 18204 transitions. [2018-11-28 20:20:04,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:04,822 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 18204 transitions. [2018-11-28 20:20:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:20:04,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:04,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:04,832 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:04,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash 631244515, now seen corresponding path program 1 times [2018-11-28 20:20:04,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:04,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:04,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:04,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:04,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:05,203 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:20:05,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:05,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:05,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:05,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:05,205 INFO L87 Difference]: Start difference. First operand 7979 states and 18204 transitions. Second operand 5 states. [2018-11-28 20:20:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:05,535 INFO L93 Difference]: Finished difference Result 8886 states and 20162 transitions. [2018-11-28 20:20:05,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:20:05,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-28 20:20:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:05,547 INFO L225 Difference]: With dead ends: 8886 [2018-11-28 20:20:05,548 INFO L226 Difference]: Without dead ends: 8886 [2018-11-28 20:20:05,548 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:20:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states. [2018-11-28 20:20:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 6875. [2018-11-28 20:20:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6875 states. [2018-11-28 20:20:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 15723 transitions. [2018-11-28 20:20:05,637 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 15723 transitions. Word has length 94 [2018-11-28 20:20:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:05,638 INFO L480 AbstractCegarLoop]: Abstraction has 6875 states and 15723 transitions. [2018-11-28 20:20:05,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 15723 transitions. [2018-11-28 20:20:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:20:05,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:05,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:05,649 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:05,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash 376507970, now seen corresponding path program 1 times [2018-11-28 20:20:05,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:05,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:05,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:05,786 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:20:05,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:05,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:20:05,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:20:05,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:20:05,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:20:05,787 INFO L87 Difference]: Start difference. First operand 6875 states and 15723 transitions. Second operand 5 states. [2018-11-28 20:20:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:06,148 INFO L93 Difference]: Finished difference Result 8123 states and 18363 transitions. [2018-11-28 20:20:06,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:20:06,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-28 20:20:06,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:06,161 INFO L225 Difference]: With dead ends: 8123 [2018-11-28 20:20:06,161 INFO L226 Difference]: Without dead ends: 7992 [2018-11-28 20:20:06,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 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:20:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7992 states. [2018-11-28 20:20:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7992 to 7614. [2018-11-28 20:20:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2018-11-28 20:20:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 17342 transitions. [2018-11-28 20:20:06,258 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 17342 transitions. Word has length 94 [2018-11-28 20:20:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:06,258 INFO L480 AbstractCegarLoop]: Abstraction has 7614 states and 17342 transitions. [2018-11-28 20:20:06,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:20:06,259 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 17342 transitions. [2018-11-28 20:20:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:20:06,270 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:06,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:06,271 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:06,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:06,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1621272451, now seen corresponding path program 1 times [2018-11-28 20:20:06,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:06,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:06,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:06,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:06,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:06,530 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:20:06,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:06,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:06,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:06,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:06,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:06,531 INFO L87 Difference]: Start difference. First operand 7614 states and 17342 transitions. Second operand 6 states. [2018-11-28 20:20:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:06,972 INFO L93 Difference]: Finished difference Result 9775 states and 22056 transitions. [2018-11-28 20:20:06,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:20:06,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 20:20:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:06,987 INFO L225 Difference]: With dead ends: 9775 [2018-11-28 20:20:06,987 INFO L226 Difference]: Without dead ends: 9667 [2018-11-28 20:20:06,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:20:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9667 states. [2018-11-28 20:20:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9667 to 7441. [2018-11-28 20:20:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2018-11-28 20:20:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 16948 transitions. [2018-11-28 20:20:07,085 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 16948 transitions. Word has length 94 [2018-11-28 20:20:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:07,085 INFO L480 AbstractCegarLoop]: Abstraction has 7441 states and 16948 transitions. [2018-11-28 20:20:07,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 16948 transitions. [2018-11-28 20:20:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:20:07,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:07,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:07,094 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:07,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:07,095 INFO L82 PathProgramCache]: Analyzing trace with hash 383295530, now seen corresponding path program 1 times [2018-11-28 20:20:07,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:07,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:07,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:07,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:07,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:07,399 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:20:07,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:07,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:20:07,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:20:07,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:20:07,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:20:07,402 INFO L87 Difference]: Start difference. First operand 7441 states and 16948 transitions. Second operand 9 states. [2018-11-28 20:20:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:09,268 INFO L93 Difference]: Finished difference Result 10480 states and 23807 transitions. [2018-11-28 20:20:09,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 20:20:09,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-11-28 20:20:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:09,283 INFO L225 Difference]: With dead ends: 10480 [2018-11-28 20:20:09,283 INFO L226 Difference]: Without dead ends: 10448 [2018-11-28 20:20:09,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:20:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10448 states. [2018-11-28 20:20:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10448 to 9009. [2018-11-28 20:20:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9009 states. [2018-11-28 20:20:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9009 states to 9009 states and 20408 transitions. [2018-11-28 20:20:09,388 INFO L78 Accepts]: Start accepts. Automaton has 9009 states and 20408 transitions. Word has length 94 [2018-11-28 20:20:09,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:09,389 INFO L480 AbstractCegarLoop]: Abstraction has 9009 states and 20408 transitions. [2018-11-28 20:20:09,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:20:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 9009 states and 20408 transitions. [2018-11-28 20:20:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:20:09,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:09,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:09,400 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:09,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:09,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1413655829, now seen corresponding path program 1 times [2018-11-28 20:20:09,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:09,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:09,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:09,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:09,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:09,832 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:20:09,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:09,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:20:09,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:20:09,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:20:09,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:09,834 INFO L87 Difference]: Start difference. First operand 9009 states and 20408 transitions. Second operand 8 states. [2018-11-28 20:20:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:10,371 INFO L93 Difference]: Finished difference Result 14006 states and 32226 transitions. [2018-11-28 20:20:10,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:20:10,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-11-28 20:20:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:10,392 INFO L225 Difference]: With dead ends: 14006 [2018-11-28 20:20:10,392 INFO L226 Difference]: Without dead ends: 14006 [2018-11-28 20:20:10,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:20:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14006 states. [2018-11-28 20:20:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14006 to 9587. [2018-11-28 20:20:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9587 states. [2018-11-28 20:20:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9587 states to 9587 states and 21909 transitions. [2018-11-28 20:20:10,545 INFO L78 Accepts]: Start accepts. Automaton has 9587 states and 21909 transitions. Word has length 94 [2018-11-28 20:20:10,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:10,545 INFO L480 AbstractCegarLoop]: Abstraction has 9587 states and 21909 transitions. [2018-11-28 20:20:10,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:20:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 9587 states and 21909 transitions. [2018-11-28 20:20:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:20:10,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:10,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:10,557 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:10,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:10,557 INFO L82 PathProgramCache]: Analyzing trace with hash -526152148, now seen corresponding path program 1 times [2018-11-28 20:20:10,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:10,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:10,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:10,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:10,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:10,670 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:20:10,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:10,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:20:10,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:20:10,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:20:10,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:20:10,671 INFO L87 Difference]: Start difference. First operand 9587 states and 21909 transitions. Second operand 3 states. [2018-11-28 20:20:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:10,841 INFO L93 Difference]: Finished difference Result 9331 states and 21109 transitions. [2018-11-28 20:20:10,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:20:10,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-11-28 20:20:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:10,859 INFO L225 Difference]: With dead ends: 9331 [2018-11-28 20:20:10,860 INFO L226 Difference]: Without dead ends: 9299 [2018-11-28 20:20:10,860 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:20:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9299 states. [2018-11-28 20:20:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9299 to 7512. [2018-11-28 20:20:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7512 states. [2018-11-28 20:20:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7512 states to 7512 states and 16864 transitions. [2018-11-28 20:20:10,999 INFO L78 Accepts]: Start accepts. Automaton has 7512 states and 16864 transitions. Word has length 94 [2018-11-28 20:20:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:10,999 INFO L480 AbstractCegarLoop]: Abstraction has 7512 states and 16864 transitions. [2018-11-28 20:20:10,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:20:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 7512 states and 16864 transitions. [2018-11-28 20:20:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:11,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:11,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:11,010 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:11,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:11,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1587470612, now seen corresponding path program 1 times [2018-11-28 20:20:11,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:11,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:11,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:11,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:11,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:11,447 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:20:11,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:11,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:20:11,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:20:11,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:20:11,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:20:11,450 INFO L87 Difference]: Start difference. First operand 7512 states and 16864 transitions. Second operand 9 states. [2018-11-28 20:20:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:12,497 INFO L93 Difference]: Finished difference Result 9618 states and 21293 transitions. [2018-11-28 20:20:12,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 20:20:12,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-11-28 20:20:12,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:12,511 INFO L225 Difference]: With dead ends: 9618 [2018-11-28 20:20:12,511 INFO L226 Difference]: Without dead ends: 9618 [2018-11-28 20:20:12,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-11-28 20:20:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9618 states. [2018-11-28 20:20:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9618 to 8157. [2018-11-28 20:20:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8157 states. [2018-11-28 20:20:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8157 states to 8157 states and 18196 transitions. [2018-11-28 20:20:12,618 INFO L78 Accepts]: Start accepts. Automaton has 8157 states and 18196 transitions. Word has length 96 [2018-11-28 20:20:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:12,618 INFO L480 AbstractCegarLoop]: Abstraction has 8157 states and 18196 transitions. [2018-11-28 20:20:12,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:20:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 8157 states and 18196 transitions. [2018-11-28 20:20:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:12,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:12,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:12,628 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:12,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:12,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1376119699, now seen corresponding path program 1 times [2018-11-28 20:20:12,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:12,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:12,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:12,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:12,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:12,846 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:20:12,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:12,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:20:12,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:20:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:20:12,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:20:12,847 INFO L87 Difference]: Start difference. First operand 8157 states and 18196 transitions. Second operand 9 states. [2018-11-28 20:20:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:13,407 INFO L93 Difference]: Finished difference Result 9377 states and 20770 transitions. [2018-11-28 20:20:13,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 20:20:13,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-11-28 20:20:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:13,420 INFO L225 Difference]: With dead ends: 9377 [2018-11-28 20:20:13,420 INFO L226 Difference]: Without dead ends: 9377 [2018-11-28 20:20:13,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-11-28 20:20:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2018-11-28 20:20:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 6927. [2018-11-28 20:20:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6927 states. [2018-11-28 20:20:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6927 states to 6927 states and 15428 transitions. [2018-11-28 20:20:13,514 INFO L78 Accepts]: Start accepts. Automaton has 6927 states and 15428 transitions. Word has length 96 [2018-11-28 20:20:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:13,514 INFO L480 AbstractCegarLoop]: Abstraction has 6927 states and 15428 transitions. [2018-11-28 20:20:13,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:20:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 6927 states and 15428 transitions. [2018-11-28 20:20:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:13,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:13,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:13,522 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:13,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:13,523 INFO L82 PathProgramCache]: Analyzing trace with hash -488616018, now seen corresponding path program 1 times [2018-11-28 20:20:13,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:13,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:13,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:13,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:13,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:13,775 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:20:13,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:13,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:20:13,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:20:13,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:20:13,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:20:13,776 INFO L87 Difference]: Start difference. First operand 6927 states and 15428 transitions. Second operand 11 states. [2018-11-28 20:20:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:15,461 INFO L93 Difference]: Finished difference Result 12952 states and 28989 transitions. [2018-11-28 20:20:15,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:20:15,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-28 20:20:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:15,474 INFO L225 Difference]: With dead ends: 12952 [2018-11-28 20:20:15,474 INFO L226 Difference]: Without dead ends: 8957 [2018-11-28 20:20:15,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-28 20:20:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8957 states. [2018-11-28 20:20:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8957 to 6751. [2018-11-28 20:20:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6751 states. [2018-11-28 20:20:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6751 states to 6751 states and 14998 transitions. [2018-11-28 20:20:15,558 INFO L78 Accepts]: Start accepts. Automaton has 6751 states and 14998 transitions. Word has length 96 [2018-11-28 20:20:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:15,558 INFO L480 AbstractCegarLoop]: Abstraction has 6751 states and 14998 transitions. [2018-11-28 20:20:15,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:20:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6751 states and 14998 transitions. [2018-11-28 20:20:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:15,566 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:15,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:15,567 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:15,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:15,567 INFO L82 PathProgramCache]: Analyzing trace with hash 537589784, now seen corresponding path program 1 times [2018-11-28 20:20:15,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:15,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:15,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:15,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:15,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:16,207 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2018-11-28 20:20:16,218 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:20:16,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:16,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:16,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:16,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:16,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:16,219 INFO L87 Difference]: Start difference. First operand 6751 states and 14998 transitions. Second operand 6 states. [2018-11-28 20:20:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:16,533 INFO L93 Difference]: Finished difference Result 6166 states and 13497 transitions. [2018-11-28 20:20:16,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:20:16,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-28 20:20:16,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:16,543 INFO L225 Difference]: With dead ends: 6166 [2018-11-28 20:20:16,544 INFO L226 Difference]: Without dead ends: 6166 [2018-11-28 20:20:16,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:16,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2018-11-28 20:20:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 5734. [2018-11-28 20:20:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5734 states. [2018-11-28 20:20:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 12590 transitions. [2018-11-28 20:20:16,611 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 12590 transitions. Word has length 96 [2018-11-28 20:20:16,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:16,611 INFO L480 AbstractCegarLoop]: Abstraction has 5734 states and 12590 transitions. [2018-11-28 20:20:16,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 12590 transitions. [2018-11-28 20:20:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:16,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:16,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:16,620 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:16,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1552227223, now seen corresponding path program 1 times [2018-11-28 20:20:16,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:16,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:16,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:16,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:16,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:17,239 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 15 [2018-11-28 20:20:17,304 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:20:17,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:17,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:17,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:17,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:17,305 INFO L87 Difference]: Start difference. First operand 5734 states and 12590 transitions. Second operand 7 states. [2018-11-28 20:20:17,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:17,661 INFO L93 Difference]: Finished difference Result 7393 states and 16128 transitions. [2018-11-28 20:20:17,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 20:20:17,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-28 20:20:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:17,672 INFO L225 Difference]: With dead ends: 7393 [2018-11-28 20:20:17,672 INFO L226 Difference]: Without dead ends: 7349 [2018-11-28 20:20:17,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:20:17,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7349 states. [2018-11-28 20:20:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7349 to 6005. [2018-11-28 20:20:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6005 states. [2018-11-28 20:20:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6005 states to 6005 states and 13184 transitions. [2018-11-28 20:20:17,748 INFO L78 Accepts]: Start accepts. Automaton has 6005 states and 13184 transitions. Word has length 96 [2018-11-28 20:20:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:17,749 INFO L480 AbstractCegarLoop]: Abstraction has 6005 states and 13184 transitions. [2018-11-28 20:20:17,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6005 states and 13184 transitions. [2018-11-28 20:20:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:17,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:17,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:17,756 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:17,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:17,757 INFO L82 PathProgramCache]: Analyzing trace with hash 795058474, now seen corresponding path program 2 times [2018-11-28 20:20:17,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:17,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:17,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:17,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:17,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:17,980 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:20:17,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:17,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:17,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:17,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:17,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:17,982 INFO L87 Difference]: Start difference. First operand 6005 states and 13184 transitions. Second operand 7 states. [2018-11-28 20:20:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:18,472 INFO L93 Difference]: Finished difference Result 6811 states and 14983 transitions. [2018-11-28 20:20:18,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:18,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-28 20:20:18,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:18,482 INFO L225 Difference]: With dead ends: 6811 [2018-11-28 20:20:18,482 INFO L226 Difference]: Without dead ends: 6811 [2018-11-28 20:20:18,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:20:18,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6811 states. [2018-11-28 20:20:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6811 to 6217. [2018-11-28 20:20:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2018-11-28 20:20:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 13636 transitions. [2018-11-28 20:20:18,554 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 13636 transitions. Word has length 96 [2018-11-28 20:20:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:18,555 INFO L480 AbstractCegarLoop]: Abstraction has 6217 states and 13636 transitions. [2018-11-28 20:20:18,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 13636 transitions. [2018-11-28 20:20:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:18,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:18,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:18,563 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:18,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:18,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2071923529, now seen corresponding path program 1 times [2018-11-28 20:20:18,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:18,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:18,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:18,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:20:18,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:18,878 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 20:20:19,198 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:20:19,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:19,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:19,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:19,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:19,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:19,199 INFO L87 Difference]: Start difference. First operand 6217 states and 13636 transitions. Second operand 6 states. [2018-11-28 20:20:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:19,945 INFO L93 Difference]: Finished difference Result 8725 states and 18969 transitions. [2018-11-28 20:20:19,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:20:19,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-28 20:20:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:19,958 INFO L225 Difference]: With dead ends: 8725 [2018-11-28 20:20:19,958 INFO L226 Difference]: Without dead ends: 8634 [2018-11-28 20:20:19,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:20:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8634 states. [2018-11-28 20:20:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8634 to 6865. [2018-11-28 20:20:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6865 states. [2018-11-28 20:20:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6865 states to 6865 states and 15122 transitions. [2018-11-28 20:20:20,043 INFO L78 Accepts]: Start accepts. Automaton has 6865 states and 15122 transitions. Word has length 96 [2018-11-28 20:20:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:20,043 INFO L480 AbstractCegarLoop]: Abstraction has 6865 states and 15122 transitions. [2018-11-28 20:20:20,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 6865 states and 15122 transitions. [2018-11-28 20:20:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:20,052 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:20,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:20,053 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:20,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:20,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2011692854, now seen corresponding path program 1 times [2018-11-28 20:20:20,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:20,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:20,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:20,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:20,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:20,524 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:20:20,560 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:20:20,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:20,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:20:20,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:20:20,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:20:20,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:20:20,561 INFO L87 Difference]: Start difference. First operand 6865 states and 15122 transitions. Second operand 6 states. [2018-11-28 20:20:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:20,899 INFO L93 Difference]: Finished difference Result 7737 states and 16840 transitions. [2018-11-28 20:20:20,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:20:20,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-11-28 20:20:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:20,908 INFO L225 Difference]: With dead ends: 7737 [2018-11-28 20:20:20,908 INFO L226 Difference]: Without dead ends: 7635 [2018-11-28 20:20:20,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7635 states. [2018-11-28 20:20:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7635 to 6856. [2018-11-28 20:20:20,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6856 states. [2018-11-28 20:20:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6856 states to 6856 states and 15024 transitions. [2018-11-28 20:20:20,978 INFO L78 Accepts]: Start accepts. Automaton has 6856 states and 15024 transitions. Word has length 96 [2018-11-28 20:20:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:20,978 INFO L480 AbstractCegarLoop]: Abstraction has 6856 states and 15024 transitions. [2018-11-28 20:20:20,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:20:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 6856 states and 15024 transitions. [2018-11-28 20:20:20,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:20,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:20,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:20,987 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:20,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:20,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1529942070, now seen corresponding path program 1 times [2018-11-28 20:20:20,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:20,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:20,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:20,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:20,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:21,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:20:21,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:20:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:20:21,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:20:21,283 INFO L87 Difference]: Start difference. First operand 6856 states and 15024 transitions. Second operand 9 states. [2018-11-28 20:20:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:21,969 INFO L93 Difference]: Finished difference Result 8240 states and 17875 transitions. [2018-11-28 20:20:21,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:20:21,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-11-28 20:20:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:21,981 INFO L225 Difference]: With dead ends: 8240 [2018-11-28 20:20:21,981 INFO L226 Difference]: Without dead ends: 8240 [2018-11-28 20:20:21,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-11-28 20:20:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8240 states. [2018-11-28 20:20:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8240 to 7134. [2018-11-28 20:20:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2018-11-28 20:20:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 15591 transitions. [2018-11-28 20:20:22,063 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 15591 transitions. Word has length 96 [2018-11-28 20:20:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:22,064 INFO L480 AbstractCegarLoop]: Abstraction has 7134 states and 15591 transitions. [2018-11-28 20:20:22,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:20:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 15591 transitions. [2018-11-28 20:20:22,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:22,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:22,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:22,074 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:22,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:22,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1714740938, now seen corresponding path program 1 times [2018-11-28 20:20:22,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:22,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:22,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:22,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:20:22,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:22,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:20:22,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:20:22,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:20:22,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:20:22,457 INFO L87 Difference]: Start difference. First operand 7134 states and 15591 transitions. Second operand 8 states. [2018-11-28 20:20:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:23,253 INFO L93 Difference]: Finished difference Result 10362 states and 22623 transitions. [2018-11-28 20:20:23,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:20:23,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-11-28 20:20:23,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:23,267 INFO L225 Difference]: With dead ends: 10362 [2018-11-28 20:20:23,267 INFO L226 Difference]: Without dead ends: 10279 [2018-11-28 20:20:23,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-11-28 20:20:23,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10279 states. [2018-11-28 20:20:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10279 to 7525. [2018-11-28 20:20:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7525 states. [2018-11-28 20:20:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 16395 transitions. [2018-11-28 20:20:23,375 INFO L78 Accepts]: Start accepts. Automaton has 7525 states and 16395 transitions. Word has length 96 [2018-11-28 20:20:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:23,376 INFO L480 AbstractCegarLoop]: Abstraction has 7525 states and 16395 transitions. [2018-11-28 20:20:23,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:20:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 7525 states and 16395 transitions. [2018-11-28 20:20:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:23,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:23,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:23,385 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:23,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:23,386 INFO L82 PathProgramCache]: Analyzing trace with hash -362468405, now seen corresponding path program 1 times [2018-11-28 20:20:23,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:23,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:23,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:23,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:23,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:23,640 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:20:23,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:23,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:20:23,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:20:23,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:20:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:20:23,642 INFO L87 Difference]: Start difference. First operand 7525 states and 16395 transitions. Second operand 9 states. [2018-11-28 20:20:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:24,269 INFO L93 Difference]: Finished difference Result 10833 states and 23624 transitions. [2018-11-28 20:20:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:20:24,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-11-28 20:20:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:24,284 INFO L225 Difference]: With dead ends: 10833 [2018-11-28 20:20:24,284 INFO L226 Difference]: Without dead ends: 10833 [2018-11-28 20:20:24,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:20:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10833 states. [2018-11-28 20:20:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10833 to 8119. [2018-11-28 20:20:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8119 states. [2018-11-28 20:20:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8119 states to 8119 states and 17690 transitions. [2018-11-28 20:20:24,383 INFO L78 Accepts]: Start accepts. Automaton has 8119 states and 17690 transitions. Word has length 96 [2018-11-28 20:20:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:24,383 INFO L480 AbstractCegarLoop]: Abstraction has 8119 states and 17690 transitions. [2018-11-28 20:20:24,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:20:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 8119 states and 17690 transitions. [2018-11-28 20:20:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:24,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:24,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:24,395 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:24,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:24,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1254638411, now seen corresponding path program 2 times [2018-11-28 20:20:24,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:24,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:24,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:24,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:20:24,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:20:24,769 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:20:24,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:20:24,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:20:24,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:20:24,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:20:24,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:20:24,770 INFO L87 Difference]: Start difference. First operand 8119 states and 17690 transitions. Second operand 7 states. [2018-11-28 20:20:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:20:25,273 INFO L93 Difference]: Finished difference Result 10198 states and 21997 transitions. [2018-11-28 20:20:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:20:25,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-28 20:20:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:20:25,291 INFO L225 Difference]: With dead ends: 10198 [2018-11-28 20:20:25,291 INFO L226 Difference]: Without dead ends: 10198 [2018-11-28 20:20:25,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:20:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10198 states. [2018-11-28 20:20:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10198 to 8589. [2018-11-28 20:20:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8589 states. [2018-11-28 20:20:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8589 states to 8589 states and 18749 transitions. [2018-11-28 20:20:25,400 INFO L78 Accepts]: Start accepts. Automaton has 8589 states and 18749 transitions. Word has length 96 [2018-11-28 20:20:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:20:25,401 INFO L480 AbstractCegarLoop]: Abstraction has 8589 states and 18749 transitions. [2018-11-28 20:20:25,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:20:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 8589 states and 18749 transitions. [2018-11-28 20:20:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 20:20:25,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:20:25,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:20:25,411 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:20:25,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:20:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1465989324, now seen corresponding path program 2 times [2018-11-28 20:20:25,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:20:25,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:20:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:25,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:20:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:20:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:20:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:20:25,503 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:20:25,727 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:20:25,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:20:25 BasicIcfg [2018-11-28 20:20:25,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:20:25,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:20:25,731 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:20:25,731 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:20:25,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:33" (3/4) ... [2018-11-28 20:20:25,738 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:20:25,961 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:20:25,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:20:25,966 INFO L168 Benchmark]: Toolchain (without parser) took 55069.42 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 948.7 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 772.1 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:25,966 INFO L168 Benchmark]: CDTParser took 0.42 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:20:25,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 938.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:25,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:25,970 INFO L168 Benchmark]: Boogie Preprocessor took 48.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:20:25,972 INFO L168 Benchmark]: RCFGBuilder took 1393.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:25,973 INFO L168 Benchmark]: TraceAbstraction took 52349.60 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 696.4 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:25,973 INFO L168 Benchmark]: Witness Printer took 233.93 ms. Allocated memory is still 3.4 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2018-11-28 20:20:25,975 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.42 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 938.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1393.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52349.60 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 696.4 MB. Max. memory is 11.5 GB. * Witness Printer took 233.93 ms. Allocated memory is still 3.4 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] -1 pthread_t t1607; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1607, ((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, z=0] [L703] 0 x$w_buff1 = x$w_buff0 [L704] 0 x$w_buff0 = 1 [L705] 0 x$w_buff1_used = x$w_buff0_used [L706] 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, z=0] [L708] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L709] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L710] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L711] 0 x$r_buff0_thd1 = (_Bool)1 [L714] 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, z=0] [L717] 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, z=0] [L780] -1 pthread_t t1608; 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, z=0] [L781] FCALL, FORK -1 pthread_create(&t1608, ((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, z=0] [L731] 1 y = 2 [L734] 1 z = 1 [L737] 1 __unbuffered_p1_EAX = z [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=1] [L744] 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=1, __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, z=1] [L744] 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) [L745] 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=1, __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, z=1] [L745] 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)) [L746] 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=1, __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, z=1] [L746] 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)) [L747] 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=1, __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, z=1] [L747] 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)) [L748] 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=1, __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, z=1] [L748] 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)) [L749] 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=1, __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, z=1] [L749] 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)) [L750] 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=1, __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, z=1] [L750] 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)) [L751] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=1] [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=1] [L717] 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) [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=1] [L756] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=1] [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, 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, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_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, z=1] [L756] 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) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_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, z=1] [L758] 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 [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L759] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=1] [L718] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L719] 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=1, __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, z=1] [L719] 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 [L720] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=1] [L720] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L721] 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=1, __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, z=1] [L721] 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 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=1] [L760] 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=1, __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, z=1] [L760] 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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, z=1] [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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, z=1] [L787] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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, z=1] [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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, z=1] [L787] -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) [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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, z=1] [L788] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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, z=1] [L789] -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 [L790] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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, z=1] [L790] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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, z=1] [L791] -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 [L794] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 52.1s OverallTime, 41 OverallIterations, 1 TraceHistogramMax, 27.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10309 SDtfs, 11541 SDslu, 24155 SDs, 0 SdLazy, 11348 SolverSat, 567 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 102 SyntacticMatches, 43 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35692occurred in iteration=15, 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: 10.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 92660 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 3232 NumberOfCodeBlocks, 3232 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3096 ConstructedInterpolants, 0 QuantifiedInterpolants, 882753 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...