./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix054_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/mix054_tso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27f95b3de1a07a1536a44b1abfe1ed78fe2c2e10 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0ed9222-m [2019-01-13 03:13:28,955 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:13:28,957 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:13:28,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:13:28,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:13:28,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:13:28,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:13:28,979 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:13:28,981 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:13:28,982 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:13:28,983 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:13:28,983 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:13:28,984 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:13:28,985 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:13:28,986 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:13:28,987 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:13:28,988 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:13:28,990 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:13:28,992 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:13:28,994 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:13:28,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:13:28,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:13:28,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:13:28,999 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:13:28,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:13:29,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:13:29,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:13:29,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:13:29,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:13:29,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:13:29,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:13:29,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:13:29,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:13:29,006 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:13:29,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:13:29,011 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:13:29,011 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 03:13:29,027 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:13:29,027 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:13:29,028 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:13:29,029 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:13:29,029 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:13:29,030 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:13:29,030 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:13:29,030 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:13:29,030 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:13:29,030 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:13:29,030 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:13:29,031 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:13:29,031 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:13:29,031 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:13:29,031 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:13:29,031 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:13:29,032 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:13:29,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:13:29,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:13:29,034 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:13:29,034 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:13:29,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:13:29,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:13:29,035 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:13:29,035 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:13:29,035 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:13:29,035 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:13:29,035 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:13:29,036 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 -> 27f95b3de1a07a1536a44b1abfe1ed78fe2c2e10 [2019-01-13 03:13:29,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:13:29,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:13:29,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:13:29,092 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:13:29,093 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:13:29,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix054_tso.opt_false-unreach-call.i [2019-01-13 03:13:29,156 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad143f50/1bc42c1a8488451692a719bdc5cc65b8/FLAG396a46d6f [2019-01-13 03:13:29,630 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:13:29,631 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix054_tso.opt_false-unreach-call.i [2019-01-13 03:13:29,645 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad143f50/1bc42c1a8488451692a719bdc5cc65b8/FLAG396a46d6f [2019-01-13 03:13:29,921 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad143f50/1bc42c1a8488451692a719bdc5cc65b8 [2019-01-13 03:13:29,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:13:29,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:13:29,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:13:29,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:13:29,932 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:13:29,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:13:29" (1/1) ... [2019-01-13 03:13:29,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f173b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:29, skipping insertion in model container [2019-01-13 03:13:29,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:13:29" (1/1) ... [2019-01-13 03:13:29,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:13:29,995 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:13:30,502 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:13:30,522 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:13:30,716 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:13:30,821 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:13:30,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30 WrapperNode [2019-01-13 03:13:30,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:13:30,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:13:30,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:13:30,824 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:13:30,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:13:30,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:13:30,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:13:30,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:13:30,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (1/1) ... [2019-01-13 03:13:30,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:13:30,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:13:30,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:13:30,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:13:30,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (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 [2019-01-13 03:13:31,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:13:31,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:13:31,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:13:31,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:13:31,009 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:13:31,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:13:31,009 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:13:31,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:13:31,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:13:31,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:13:31,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:13:31,013 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 03:13:32,387 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:13:32,388 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:13:32,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:13:32 BoogieIcfgContainer [2019-01-13 03:13:32,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:13:32,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:13:32,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:13:32,395 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:13:32,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:13:29" (1/3) ... [2019-01-13 03:13:32,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539f5156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:13:32, skipping insertion in model container [2019-01-13 03:13:32,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:13:30" (2/3) ... [2019-01-13 03:13:32,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539f5156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:13:32, skipping insertion in model container [2019-01-13 03:13:32,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:13:32" (3/3) ... [2019-01-13 03:13:32,403 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_tso.opt_false-unreach-call.i [2019-01-13 03:13:32,461 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,462 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,462 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,462 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,463 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,464 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,465 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,466 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,466 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,467 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,467 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,468 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,468 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,468 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,469 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,469 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,469 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,472 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,472 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,473 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,473 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,473 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,474 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,475 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,475 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,475 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,476 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,477 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,479 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,480 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,480 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,480 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,480 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,480 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,483 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,497 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,498 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,500 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,501 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:13:32,514 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:13:32,514 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:13:32,523 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:13:32,541 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:13:32,568 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:13:32,569 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:13:32,569 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:13:32,569 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:13:32,569 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:13:32,569 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:13:32,569 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:13:32,570 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:13:32,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:13:32,582 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2019-01-13 03:13:34,137 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25087 states. [2019-01-13 03:13:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 25087 states. [2019-01-13 03:13:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 03:13:34,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:34,152 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] [2019-01-13 03:13:34,156 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:34,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:34,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1104590460, now seen corresponding path program 1 times [2019-01-13 03:13:34,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:34,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:34,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:34,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:34,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:34,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:34,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:34,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:34,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:34,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:34,529 INFO L87 Difference]: Start difference. First operand 25087 states. Second operand 4 states. [2019-01-13 03:13:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:35,895 INFO L93 Difference]: Finished difference Result 45387 states and 177625 transitions. [2019-01-13 03:13:35,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:13:35,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-01-13 03:13:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:36,308 INFO L225 Difference]: With dead ends: 45387 [2019-01-13 03:13:36,308 INFO L226 Difference]: Without dead ends: 40627 [2019-01-13 03:13:36,311 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 [2019-01-13 03:13:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40627 states. [2019-01-13 03:13:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40627 to 23661. [2019-01-13 03:13:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23661 states. [2019-01-13 03:13:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23661 states to 23661 states and 92542 transitions. [2019-01-13 03:13:38,144 INFO L78 Accepts]: Start accepts. Automaton has 23661 states and 92542 transitions. Word has length 36 [2019-01-13 03:13:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:38,145 INFO L480 AbstractCegarLoop]: Abstraction has 23661 states and 92542 transitions. [2019-01-13 03:13:38,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 23661 states and 92542 transitions. [2019-01-13 03:13:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 03:13:38,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:38,152 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] [2019-01-13 03:13:38,152 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:38,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1826409231, now seen corresponding path program 1 times [2019-01-13 03:13:38,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:38,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:38,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:38,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:38,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:38,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:13:38,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:13:38,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:13:38,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:38,402 INFO L87 Difference]: Start difference. First operand 23661 states and 92542 transitions. Second operand 5 states. [2019-01-13 03:13:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:41,297 INFO L93 Difference]: Finished difference Result 64829 states and 241368 transitions. [2019-01-13 03:13:41,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:13:41,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-01-13 03:13:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:41,677 INFO L225 Difference]: With dead ends: 64829 [2019-01-13 03:13:41,678 INFO L226 Difference]: Without dead ends: 64669 [2019-01-13 03:13:41,679 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 [2019-01-13 03:13:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64669 states. [2019-01-13 03:13:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64669 to 37141. [2019-01-13 03:13:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37141 states. [2019-01-13 03:13:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37141 states to 37141 states and 138283 transitions. [2019-01-13 03:13:43,524 INFO L78 Accepts]: Start accepts. Automaton has 37141 states and 138283 transitions. Word has length 43 [2019-01-13 03:13:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:43,526 INFO L480 AbstractCegarLoop]: Abstraction has 37141 states and 138283 transitions. [2019-01-13 03:13:43,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:13:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 37141 states and 138283 transitions. [2019-01-13 03:13:43,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 03:13:43,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:43,531 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] [2019-01-13 03:13:43,532 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:43,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1003362560, now seen corresponding path program 1 times [2019-01-13 03:13:43,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:43,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:43,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:43,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:43,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:43,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:43,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:43,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:43,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:43,638 INFO L87 Difference]: Start difference. First operand 37141 states and 138283 transitions. Second operand 4 states. [2019-01-13 03:13:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:43,730 INFO L93 Difference]: Finished difference Result 12363 states and 41176 transitions. [2019-01-13 03:13:43,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:13:43,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-13 03:13:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:43,772 INFO L225 Difference]: With dead ends: 12363 [2019-01-13 03:13:43,772 INFO L226 Difference]: Without dead ends: 11842 [2019-01-13 03:13:43,773 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 [2019-01-13 03:13:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2019-01-13 03:13:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 11842. [2019-01-13 03:13:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2019-01-13 03:13:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 39621 transitions. [2019-01-13 03:13:44,050 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 39621 transitions. Word has length 44 [2019-01-13 03:13:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:44,051 INFO L480 AbstractCegarLoop]: Abstraction has 11842 states and 39621 transitions. [2019-01-13 03:13:44,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 39621 transitions. [2019-01-13 03:13:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 03:13:44,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:44,057 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] [2019-01-13 03:13:44,057 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:44,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash 77217480, now seen corresponding path program 1 times [2019-01-13 03:13:44,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:44,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:44,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:44,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:44,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:44,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:44,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:44,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:44,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:44,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:44,326 INFO L87 Difference]: Start difference. First operand 11842 states and 39621 transitions. Second operand 4 states. [2019-01-13 03:13:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:44,739 INFO L93 Difference]: Finished difference Result 17018 states and 55692 transitions. [2019-01-13 03:13:44,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:13:44,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-13 03:13:44,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:44,773 INFO L225 Difference]: With dead ends: 17018 [2019-01-13 03:13:44,773 INFO L226 Difference]: Without dead ends: 17018 [2019-01-13 03:13:44,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17018 states. [2019-01-13 03:13:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17018 to 12878. [2019-01-13 03:13:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12878 states. [2019-01-13 03:13:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12878 states to 12878 states and 42719 transitions. [2019-01-13 03:13:45,097 INFO L78 Accepts]: Start accepts. Automaton has 12878 states and 42719 transitions. Word has length 57 [2019-01-13 03:13:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:45,098 INFO L480 AbstractCegarLoop]: Abstraction has 12878 states and 42719 transitions. [2019-01-13 03:13:45,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 12878 states and 42719 transitions. [2019-01-13 03:13:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 03:13:45,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:45,110 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] [2019-01-13 03:13:45,110 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:45,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:45,110 INFO L82 PathProgramCache]: Analyzing trace with hash -257181528, now seen corresponding path program 1 times [2019-01-13 03:13:45,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:45,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:45,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:45,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:45,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:45,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:45,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:45,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:45,265 INFO L87 Difference]: Start difference. First operand 12878 states and 42719 transitions. Second operand 4 states. [2019-01-13 03:13:45,485 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 03:13:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:46,730 INFO L93 Difference]: Finished difference Result 18385 states and 59996 transitions. [2019-01-13 03:13:46,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:13:46,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-13 03:13:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:46,763 INFO L225 Difference]: With dead ends: 18385 [2019-01-13 03:13:46,763 INFO L226 Difference]: Without dead ends: 18385 [2019-01-13 03:13:46,763 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 [2019-01-13 03:13:46,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18385 states. [2019-01-13 03:13:46,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18385 to 16342. [2019-01-13 03:13:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16342 states. [2019-01-13 03:13:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 53813 transitions. [2019-01-13 03:13:47,044 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 53813 transitions. Word has length 57 [2019-01-13 03:13:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:47,044 INFO L480 AbstractCegarLoop]: Abstraction has 16342 states and 53813 transitions. [2019-01-13 03:13:47,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 53813 transitions. [2019-01-13 03:13:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 03:13:47,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:47,054 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] [2019-01-13 03:13:47,054 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:47,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:47,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1101653399, now seen corresponding path program 1 times [2019-01-13 03:13:47,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:47,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:47,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:47,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:47,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:47,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:47,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:47,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:47,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:47,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:47,628 INFO L87 Difference]: Start difference. First operand 16342 states and 53813 transitions. Second operand 6 states. [2019-01-13 03:13:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:48,240 INFO L93 Difference]: Finished difference Result 17850 states and 57964 transitions. [2019-01-13 03:13:48,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:13:48,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-01-13 03:13:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:48,272 INFO L225 Difference]: With dead ends: 17850 [2019-01-13 03:13:48,272 INFO L226 Difference]: Without dead ends: 17850 [2019-01-13 03:13:48,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:13:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17850 states. [2019-01-13 03:13:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17850 to 16896. [2019-01-13 03:13:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16896 states. [2019-01-13 03:13:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16896 states to 16896 states and 55322 transitions. [2019-01-13 03:13:48,572 INFO L78 Accepts]: Start accepts. Automaton has 16896 states and 55322 transitions. Word has length 57 [2019-01-13 03:13:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:48,572 INFO L480 AbstractCegarLoop]: Abstraction has 16896 states and 55322 transitions. [2019-01-13 03:13:48,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 16896 states and 55322 transitions. [2019-01-13 03:13:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-13 03:13:48,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:48,582 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] [2019-01-13 03:13:48,583 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:48,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash 405898410, now seen corresponding path program 1 times [2019-01-13 03:13:48,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:48,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:48,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:48,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:48,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:48,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:48,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:13:48,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:13:48,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:13:48,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:48,690 INFO L87 Difference]: Start difference. First operand 16896 states and 55322 transitions. Second operand 5 states. [2019-01-13 03:13:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:48,752 INFO L93 Difference]: Finished difference Result 3060 states and 7985 transitions. [2019-01-13 03:13:48,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:13:48,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-13 03:13:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:48,759 INFO L225 Difference]: With dead ends: 3060 [2019-01-13 03:13:48,760 INFO L226 Difference]: Without dead ends: 2492 [2019-01-13 03:13:48,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2019-01-13 03:13:48,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2349. [2019-01-13 03:13:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2019-01-13 03:13:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 6106 transitions. [2019-01-13 03:13:48,789 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 6106 transitions. Word has length 57 [2019-01-13 03:13:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:48,789 INFO L480 AbstractCegarLoop]: Abstraction has 2349 states and 6106 transitions. [2019-01-13 03:13:48,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:13:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 6106 transitions. [2019-01-13 03:13:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 03:13:48,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:48,797 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] [2019-01-13 03:13:48,797 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:48,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1812807878, now seen corresponding path program 1 times [2019-01-13 03:13:48,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:48,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:48,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:48,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:48,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:49,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:49,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:13:49,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:13:49,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:13:49,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:49,068 INFO L87 Difference]: Start difference. First operand 2349 states and 6106 transitions. Second operand 7 states. [2019-01-13 03:13:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:49,601 INFO L93 Difference]: Finished difference Result 2825 states and 7052 transitions. [2019-01-13 03:13:49,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:13:49,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-01-13 03:13:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:49,607 INFO L225 Difference]: With dead ends: 2825 [2019-01-13 03:13:49,607 INFO L226 Difference]: Without dead ends: 2730 [2019-01-13 03:13:49,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:13:49,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2019-01-13 03:13:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2626. [2019-01-13 03:13:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2019-01-13 03:13:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 6668 transitions. [2019-01-13 03:13:49,648 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 6668 transitions. Word has length 90 [2019-01-13 03:13:49,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:49,649 INFO L480 AbstractCegarLoop]: Abstraction has 2626 states and 6668 transitions. [2019-01-13 03:13:49,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:13:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 6668 transitions. [2019-01-13 03:13:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-13 03:13:49,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:49,656 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] [2019-01-13 03:13:49,657 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:49,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:49,658 INFO L82 PathProgramCache]: Analyzing trace with hash -843226855, now seen corresponding path program 1 times [2019-01-13 03:13:49,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:49,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:49,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:49,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:49,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:50,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:50,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:13:50,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:13:50,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:13:50,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:50,014 INFO L87 Difference]: Start difference. First operand 2626 states and 6668 transitions. Second operand 5 states. [2019-01-13 03:13:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:50,505 INFO L93 Difference]: Finished difference Result 3270 states and 8113 transitions. [2019-01-13 03:13:50,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:13:50,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-01-13 03:13:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:50,511 INFO L225 Difference]: With dead ends: 3270 [2019-01-13 03:13:50,511 INFO L226 Difference]: Without dead ends: 3207 [2019-01-13 03:13:50,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:13:50,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2019-01-13 03:13:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 2795. [2019-01-13 03:13:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2795 states. [2019-01-13 03:13:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 7021 transitions. [2019-01-13 03:13:50,558 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 7021 transitions. Word has length 90 [2019-01-13 03:13:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:50,558 INFO L480 AbstractCegarLoop]: Abstraction has 2795 states and 7021 transitions. [2019-01-13 03:13:50,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:13:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 7021 transitions. [2019-01-13 03:13:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:50,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:50,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] [2019-01-13 03:13:50,566 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:50,567 INFO L82 PathProgramCache]: Analyzing trace with hash 353378826, now seen corresponding path program 1 times [2019-01-13 03:13:50,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:50,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:50,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:50,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:50,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:50,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:50,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:50,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:50,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:50,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:50,716 INFO L87 Difference]: Start difference. First operand 2795 states and 7021 transitions. Second operand 4 states. [2019-01-13 03:13:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:50,984 INFO L93 Difference]: Finished difference Result 4535 states and 11629 transitions. [2019-01-13 03:13:50,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:13:50,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 03:13:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:50,992 INFO L225 Difference]: With dead ends: 4535 [2019-01-13 03:13:50,992 INFO L226 Difference]: Without dead ends: 4505 [2019-01-13 03:13:50,993 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 [2019-01-13 03:13:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2019-01-13 03:13:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 2571. [2019-01-13 03:13:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-01-13 03:13:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 6397 transitions. [2019-01-13 03:13:51,033 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 6397 transitions. Word has length 92 [2019-01-13 03:13:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:51,033 INFO L480 AbstractCegarLoop]: Abstraction has 2571 states and 6397 transitions. [2019-01-13 03:13:51,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 6397 transitions. [2019-01-13 03:13:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:51,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:51,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:13:51,039 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:51,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1349001223, now seen corresponding path program 1 times [2019-01-13 03:13:51,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:51,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:51,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:51,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:51,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:13:51,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:13:51,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:13:51,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:51,364 INFO L87 Difference]: Start difference. First operand 2571 states and 6397 transitions. Second operand 4 states. [2019-01-13 03:13:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:51,628 INFO L93 Difference]: Finished difference Result 2907 states and 7317 transitions. [2019-01-13 03:13:51,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:13:51,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 03:13:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:51,633 INFO L225 Difference]: With dead ends: 2907 [2019-01-13 03:13:51,634 INFO L226 Difference]: Without dead ends: 2907 [2019-01-13 03:13:51,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:13:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2019-01-13 03:13:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2875. [2019-01-13 03:13:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2875 states. [2019-01-13 03:13:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 7237 transitions. [2019-01-13 03:13:51,663 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 7237 transitions. Word has length 92 [2019-01-13 03:13:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:51,664 INFO L480 AbstractCegarLoop]: Abstraction has 2875 states and 7237 transitions. [2019-01-13 03:13:51,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:13:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 7237 transitions. [2019-01-13 03:13:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:51,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:51,668 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] [2019-01-13 03:13:51,669 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:51,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash 868756730, now seen corresponding path program 1 times [2019-01-13 03:13:51,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:51,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:51,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:51,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:51,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:52,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:52,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:52,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:52,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:52,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:52,044 INFO L87 Difference]: Start difference. First operand 2875 states and 7237 transitions. Second operand 6 states. [2019-01-13 03:13:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:52,520 INFO L93 Difference]: Finished difference Result 4283 states and 10768 transitions. [2019-01-13 03:13:52,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:13:52,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 03:13:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:52,528 INFO L225 Difference]: With dead ends: 4283 [2019-01-13 03:13:52,528 INFO L226 Difference]: Without dead ends: 4251 [2019-01-13 03:13:52,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2019-01-13 03:13:52,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 3787. [2019-01-13 03:13:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3787 states. [2019-01-13 03:13:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 3787 states and 9572 transitions. [2019-01-13 03:13:52,573 INFO L78 Accepts]: Start accepts. Automaton has 3787 states and 9572 transitions. Word has length 92 [2019-01-13 03:13:52,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:52,574 INFO L480 AbstractCegarLoop]: Abstraction has 3787 states and 9572 transitions. [2019-01-13 03:13:52,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 9572 transitions. [2019-01-13 03:13:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:52,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:52,580 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] [2019-01-13 03:13:52,580 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:52,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1830370747, now seen corresponding path program 1 times [2019-01-13 03:13:52,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:52,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:52,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:52,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:52,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:52,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:52,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:13:52,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:13:52,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:13:52,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:52,845 INFO L87 Difference]: Start difference. First operand 3787 states and 9572 transitions. Second operand 7 states. [2019-01-13 03:13:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:53,502 INFO L93 Difference]: Finished difference Result 7924 states and 20461 transitions. [2019-01-13 03:13:53,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:13:53,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 03:13:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:53,514 INFO L225 Difference]: With dead ends: 7924 [2019-01-13 03:13:53,514 INFO L226 Difference]: Without dead ends: 7924 [2019-01-13 03:13:53,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-13 03:13:53,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7924 states. [2019-01-13 03:13:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7924 to 4417. [2019-01-13 03:13:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4417 states. [2019-01-13 03:13:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 4417 states and 11227 transitions. [2019-01-13 03:13:53,576 INFO L78 Accepts]: Start accepts. Automaton has 4417 states and 11227 transitions. Word has length 92 [2019-01-13 03:13:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:53,577 INFO L480 AbstractCegarLoop]: Abstraction has 4417 states and 11227 transitions. [2019-01-13 03:13:53,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:13:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4417 states and 11227 transitions. [2019-01-13 03:13:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:53,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:53,584 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] [2019-01-13 03:13:53,584 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:53,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:53,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1219832068, now seen corresponding path program 1 times [2019-01-13 03:13:53,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:53,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:53,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:53,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:53,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:53,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:53,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:13:53,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:13:53,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:13:53,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:53,858 INFO L87 Difference]: Start difference. First operand 4417 states and 11227 transitions. Second operand 7 states. [2019-01-13 03:13:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:54,242 INFO L93 Difference]: Finished difference Result 4049 states and 10322 transitions. [2019-01-13 03:13:54,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:13:54,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 03:13:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:54,248 INFO L225 Difference]: With dead ends: 4049 [2019-01-13 03:13:54,249 INFO L226 Difference]: Without dead ends: 4049 [2019-01-13 03:13:54,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:13:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4049 states. [2019-01-13 03:13:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4049 to 3896. [2019-01-13 03:13:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3896 states. [2019-01-13 03:13:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 9997 transitions. [2019-01-13 03:13:54,292 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 9997 transitions. Word has length 92 [2019-01-13 03:13:54,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:54,293 INFO L480 AbstractCegarLoop]: Abstraction has 3896 states and 9997 transitions. [2019-01-13 03:13:54,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:13:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 9997 transitions. [2019-01-13 03:13:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:54,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:54,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:13:54,299 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:54,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1611236628, now seen corresponding path program 1 times [2019-01-13 03:13:54,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:54,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:54,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:54,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:54,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:54,463 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 03:13:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:54,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:54,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:13:54,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:13:54,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:13:54,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:54,999 INFO L87 Difference]: Start difference. First operand 3896 states and 9997 transitions. Second operand 7 states. [2019-01-13 03:13:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:55,421 INFO L93 Difference]: Finished difference Result 4149 states and 10616 transitions. [2019-01-13 03:13:55,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:13:55,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-01-13 03:13:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:55,429 INFO L225 Difference]: With dead ends: 4149 [2019-01-13 03:13:55,430 INFO L226 Difference]: Without dead ends: 4149 [2019-01-13 03:13:55,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2019-01-13 03:13:55,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 3867. [2019-01-13 03:13:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3867 states. [2019-01-13 03:13:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3867 states to 3867 states and 9941 transitions. [2019-01-13 03:13:55,474 INFO L78 Accepts]: Start accepts. Automaton has 3867 states and 9941 transitions. Word has length 92 [2019-01-13 03:13:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:55,474 INFO L480 AbstractCegarLoop]: Abstraction has 3867 states and 9941 transitions. [2019-01-13 03:13:55,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:13:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3867 states and 9941 transitions. [2019-01-13 03:13:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:55,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:55,480 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] [2019-01-13 03:13:55,481 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:55,481 INFO L82 PathProgramCache]: Analyzing trace with hash -200357108, now seen corresponding path program 1 times [2019-01-13 03:13:55,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:55,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:55,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:55,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:55,781 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-13 03:13:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:55,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:55,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:13:55,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:13:55,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:13:55,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:55,811 INFO L87 Difference]: Start difference. First operand 3867 states and 9941 transitions. Second operand 5 states. [2019-01-13 03:13:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:55,972 INFO L93 Difference]: Finished difference Result 3626 states and 9302 transitions. [2019-01-13 03:13:55,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:13:55,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-01-13 03:13:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:55,979 INFO L225 Difference]: With dead ends: 3626 [2019-01-13 03:13:55,980 INFO L226 Difference]: Without dead ends: 3626 [2019-01-13 03:13:55,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-01-13 03:13:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 3543. [2019-01-13 03:13:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3543 states. [2019-01-13 03:13:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 9136 transitions. [2019-01-13 03:13:56,033 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 9136 transitions. Word has length 92 [2019-01-13 03:13:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:56,034 INFO L480 AbstractCegarLoop]: Abstraction has 3543 states and 9136 transitions. [2019-01-13 03:13:56,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:13:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 9136 transitions. [2019-01-13 03:13:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:13:56,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:56,039 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] [2019-01-13 03:13:56,040 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:56,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:56,040 INFO L82 PathProgramCache]: Analyzing trace with hash -649053747, now seen corresponding path program 1 times [2019-01-13 03:13:56,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:56,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:56,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:56,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:56,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:56,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:56,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:56,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:56,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:56,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:56,399 INFO L87 Difference]: Start difference. First operand 3543 states and 9136 transitions. Second operand 6 states. [2019-01-13 03:13:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:56,792 INFO L93 Difference]: Finished difference Result 2935 states and 7296 transitions. [2019-01-13 03:13:56,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:13:56,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-01-13 03:13:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:56,798 INFO L225 Difference]: With dead ends: 2935 [2019-01-13 03:13:56,798 INFO L226 Difference]: Without dead ends: 2935 [2019-01-13 03:13:56,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:56,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2019-01-13 03:13:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1956. [2019-01-13 03:13:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2019-01-13 03:13:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 4960 transitions. [2019-01-13 03:13:56,823 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 4960 transitions. Word has length 92 [2019-01-13 03:13:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:56,824 INFO L480 AbstractCegarLoop]: Abstraction has 1956 states and 4960 transitions. [2019-01-13 03:13:56,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 4960 transitions. [2019-01-13 03:13:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:56,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:56,827 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] [2019-01-13 03:13:56,828 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:56,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1808878702, now seen corresponding path program 1 times [2019-01-13 03:13:56,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:56,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:56,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:57,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:57,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:13:57,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:13:57,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:13:57,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:57,198 INFO L87 Difference]: Start difference. First operand 1956 states and 4960 transitions. Second operand 7 states. [2019-01-13 03:13:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:57,809 INFO L93 Difference]: Finished difference Result 2850 states and 7093 transitions. [2019-01-13 03:13:57,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:13:57,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 03:13:57,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:57,815 INFO L225 Difference]: With dead ends: 2850 [2019-01-13 03:13:57,815 INFO L226 Difference]: Without dead ends: 2850 [2019-01-13 03:13:57,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:13:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2019-01-13 03:13:57,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2311. [2019-01-13 03:13:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2311 states. [2019-01-13 03:13:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 5828 transitions. [2019-01-13 03:13:57,851 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 5828 transitions. Word has length 94 [2019-01-13 03:13:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:57,851 INFO L480 AbstractCegarLoop]: Abstraction has 2311 states and 5828 transitions. [2019-01-13 03:13:57,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:13:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 5828 transitions. [2019-01-13 03:13:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:57,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:57,856 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] [2019-01-13 03:13:57,856 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:57,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1241324113, now seen corresponding path program 1 times [2019-01-13 03:13:57,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:57,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:57,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:57,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:57,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:58,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:58,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:58,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:13:58,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:13:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:13:58,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:13:58,150 INFO L87 Difference]: Start difference. First operand 2311 states and 5828 transitions. Second operand 6 states. [2019-01-13 03:13:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:58,439 INFO L93 Difference]: Finished difference Result 2360 states and 5894 transitions. [2019-01-13 03:13:58,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:13:58,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:13:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:58,443 INFO L225 Difference]: With dead ends: 2360 [2019-01-13 03:13:58,444 INFO L226 Difference]: Without dead ends: 2360 [2019-01-13 03:13:58,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:13:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-01-13 03:13:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2281. [2019-01-13 03:13:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2019-01-13 03:13:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 5746 transitions. [2019-01-13 03:13:58,470 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 5746 transitions. Word has length 94 [2019-01-13 03:13:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:58,470 INFO L480 AbstractCegarLoop]: Abstraction has 2281 states and 5746 transitions. [2019-01-13 03:13:58,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:13:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 5746 transitions. [2019-01-13 03:13:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:58,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:58,474 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] [2019-01-13 03:13:58,475 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:58,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:58,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2138644463, now seen corresponding path program 1 times [2019-01-13 03:13:58,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:58,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:58,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:58,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:58,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:58,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:58,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:13:58,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:13:58,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:13:58,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:13:58,688 INFO L87 Difference]: Start difference. First operand 2281 states and 5746 transitions. Second operand 5 states. [2019-01-13 03:13:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:58,899 INFO L93 Difference]: Finished difference Result 2601 states and 6546 transitions. [2019-01-13 03:13:58,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:13:58,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 03:13:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:58,905 INFO L225 Difference]: With dead ends: 2601 [2019-01-13 03:13:58,906 INFO L226 Difference]: Without dead ends: 2601 [2019-01-13 03:13:58,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:13:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2019-01-13 03:13:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2009. [2019-01-13 03:13:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2019-01-13 03:13:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 5085 transitions. [2019-01-13 03:13:58,943 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 5085 transitions. Word has length 94 [2019-01-13 03:13:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:58,943 INFO L480 AbstractCegarLoop]: Abstraction has 2009 states and 5085 transitions. [2019-01-13 03:13:58,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:13:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 5085 transitions. [2019-01-13 03:13:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:58,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:58,950 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] [2019-01-13 03:13:58,950 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash -911558352, now seen corresponding path program 1 times [2019-01-13 03:13:58,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:58,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:58,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:13:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:13:59,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:13:59,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 03:13:59,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 03:13:59,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 03:13:59,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:13:59,299 INFO L87 Difference]: Start difference. First operand 2009 states and 5085 transitions. Second operand 10 states. [2019-01-13 03:13:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:13:59,901 INFO L93 Difference]: Finished difference Result 3694 states and 9553 transitions. [2019-01-13 03:13:59,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:13:59,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-01-13 03:13:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:13:59,904 INFO L225 Difference]: With dead ends: 3694 [2019-01-13 03:13:59,904 INFO L226 Difference]: Without dead ends: 1719 [2019-01-13 03:13:59,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-13 03:13:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-01-13 03:13:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-01-13 03:13:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-01-13 03:13:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 4515 transitions. [2019-01-13 03:13:59,928 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 4515 transitions. Word has length 94 [2019-01-13 03:13:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:13:59,928 INFO L480 AbstractCegarLoop]: Abstraction has 1719 states and 4515 transitions. [2019-01-13 03:13:59,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 03:13:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 4515 transitions. [2019-01-13 03:13:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:13:59,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:13:59,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:13:59,933 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:13:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:13:59,933 INFO L82 PathProgramCache]: Analyzing trace with hash 220287440, now seen corresponding path program 1 times [2019-01-13 03:13:59,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:13:59,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:13:59,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:59,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:13:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:13:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:00,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:00,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:14:00,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:14:00,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:14:00,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:14:00,114 INFO L87 Difference]: Start difference. First operand 1719 states and 4515 transitions. Second operand 6 states. [2019-01-13 03:14:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:00,608 INFO L93 Difference]: Finished difference Result 1963 states and 5062 transitions. [2019-01-13 03:14:00,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:14:00,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:14:00,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:00,612 INFO L225 Difference]: With dead ends: 1963 [2019-01-13 03:14:00,612 INFO L226 Difference]: Without dead ends: 1963 [2019-01-13 03:14:00,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:14:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-01-13 03:14:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1746. [2019-01-13 03:14:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1746 states. [2019-01-13 03:14:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 4570 transitions. [2019-01-13 03:14:00,639 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 4570 transitions. Word has length 94 [2019-01-13 03:14:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:00,639 INFO L480 AbstractCegarLoop]: Abstraction has 1746 states and 4570 transitions. [2019-01-13 03:14:00,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:14:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 4570 transitions. [2019-01-13 03:14:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:14:00,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:00,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:14:00,645 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:00,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:00,646 INFO L82 PathProgramCache]: Analyzing trace with hash 550053201, now seen corresponding path program 1 times [2019-01-13 03:14:00,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:00,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:00,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:00,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:00,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:00,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:00,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:14:00,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:14:00,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:14:00,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:14:00,778 INFO L87 Difference]: Start difference. First operand 1746 states and 4570 transitions. Second operand 6 states. [2019-01-13 03:14:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:00,870 INFO L93 Difference]: Finished difference Result 1805 states and 4679 transitions. [2019-01-13 03:14:00,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:14:00,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:14:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:00,873 INFO L225 Difference]: With dead ends: 1805 [2019-01-13 03:14:00,873 INFO L226 Difference]: Without dead ends: 1789 [2019-01-13 03:14:00,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:14:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-01-13 03:14:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1719. [2019-01-13 03:14:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-01-13 03:14:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 4507 transitions. [2019-01-13 03:14:00,892 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 4507 transitions. Word has length 94 [2019-01-13 03:14:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:00,892 INFO L480 AbstractCegarLoop]: Abstraction has 1719 states and 4507 transitions. [2019-01-13 03:14:00,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:14:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 4507 transitions. [2019-01-13 03:14:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:14:00,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:00,895 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] [2019-01-13 03:14:00,895 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:00,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1480453039, now seen corresponding path program 1 times [2019-01-13 03:14:00,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:00,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:00,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:00,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:00,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:14:01,492 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2019-01-13 03:14:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:14:01,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:14:01,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:14:01,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:14:01,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:14:01,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:14:01,692 INFO L87 Difference]: Start difference. First operand 1719 states and 4507 transitions. Second operand 6 states. [2019-01-13 03:14:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:14:01,854 INFO L93 Difference]: Finished difference Result 1761 states and 4583 transitions. [2019-01-13 03:14:01,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:14:01,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:14:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:14:01,857 INFO L225 Difference]: With dead ends: 1761 [2019-01-13 03:14:01,858 INFO L226 Difference]: Without dead ends: 1761 [2019-01-13 03:14:01,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:14:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2019-01-13 03:14:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1754. [2019-01-13 03:14:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2019-01-13 03:14:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4570 transitions. [2019-01-13 03:14:01,877 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 4570 transitions. Word has length 94 [2019-01-13 03:14:01,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:14:01,877 INFO L480 AbstractCegarLoop]: Abstraction has 1754 states and 4570 transitions. [2019-01-13 03:14:01,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:14:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 4570 transitions. [2019-01-13 03:14:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:14:01,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:14:01,881 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] [2019-01-13 03:14:01,881 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:14:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:14:01,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1150687278, now seen corresponding path program 2 times [2019-01-13 03:14:01,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:14:01,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:14:01,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:01,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:14:01,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:14:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:14:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:14:01,968 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:14:02,158 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:14:02,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:14:02 BasicIcfg [2019-01-13 03:14:02,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:14:02,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:14:02,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:14:02,162 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:14:02,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:13:32" (3/4) ... [2019-01-13 03:14:02,167 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:14:02,354 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:14:02,355 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:14:02,356 INFO L168 Benchmark]: Toolchain (without parser) took 32429.72 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 936.6 MB in the beginning and 1.8 GB in the end (delta: -854.3 MB). Peak memory consumption was 474.3 MB. Max. memory is 11.5 GB. [2019-01-13 03:14:02,356 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:14:02,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 894.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-13 03:14:02,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.27 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. [2019-01-13 03:14:02,362 INFO L168 Benchmark]: Boogie Preprocessor took 42.28 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. [2019-01-13 03:14:02,362 INFO L168 Benchmark]: RCFGBuilder took 1451.02 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: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-01-13 03:14:02,363 INFO L168 Benchmark]: TraceAbstraction took 29770.44 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -753.7 MB). Peak memory consumption was 432.2 MB. Max. memory is 11.5 GB. [2019-01-13 03:14:02,363 INFO L168 Benchmark]: Witness Printer took 192.66 ms. Allocated memory is still 2.4 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-01-13 03:14:02,370 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 894.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.27 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 42.28 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 1451.02 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: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29770.44 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -753.7 MB). Peak memory consumption was 432.2 MB. Max. memory is 11.5 GB. * Witness Printer took 192.66 ms. Allocated memory is still 2.4 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 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] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L679] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L680] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L681] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L682] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L683] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L684] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L685] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L686] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L687] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}] [L688] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L689] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L690] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L691] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L693] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L755] -1 pthread_t t1457; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L756] FCALL, FORK -1 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] -1 pthread_t t1458; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] FCALL, FORK -1 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 x$w_buff1 = x$w_buff0 [L720] 0 x$w_buff0 = 2 [L721] 0 x$w_buff1_used = x$w_buff0_used [L722] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L725] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L726] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L727] 0 x$r_buff0_thd2 = (_Bool)1 [L730] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] 1 y = 1 [L702] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L705] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L705] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L706] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L740] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] -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) [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L766] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] -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 [L767] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L768] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] -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 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 x$flush_delayed = weak$$choice2 [L774] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L776] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L778] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L778] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L780] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L781] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] -1 x = x$flush_delayed ? x$mem_tmp : x [L784] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 29.5s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 14.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5127 SDtfs, 4528 SDslu, 10401 SDs, 0 SdLazy, 4553 SolverSat, 261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 60 SyntacticMatches, 18 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37141occurred in iteration=2, 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: 5.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 61228 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2019 NumberOfCodeBlocks, 2019 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1901 ConstructedInterpolants, 0 QuantifiedInterpolants, 402473 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...