./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix034_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix034_rmo.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a052330b4479085cb8bf5435fb8596eeb294355 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 20:34:53,048 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 20:34:53,050 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 20:34:53,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 20:34:53,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 20:34:53,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 20:34:53,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 20:34:53,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 20:34:53,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 20:34:53,070 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 20:34:53,071 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 20:34:53,072 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 20:34:53,073 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 20:34:53,074 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 20:34:53,077 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 20:34:53,078 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 20:34:53,079 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 20:34:53,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 20:34:53,088 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 20:34:53,093 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 20:34:53,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 20:34:53,099 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 20:34:53,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 20:34:53,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 20:34:53,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 20:34:53,106 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 20:34:53,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 20:34:53,108 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 20:34:53,109 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 20:34:53,110 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 20:34:53,111 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 20:34:53,111 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 20:34:53,111 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 20:34:53,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 20:34:53,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 20:34:53,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 20:34:53,114 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 20:34:53,141 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 20:34:53,142 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 20:34:53,143 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 20:34:53,143 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 20:34:53,143 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 20:34:53,143 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 20:34:53,147 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 20:34:53,147 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 20:34:53,147 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 20:34:53,147 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 20:34:53,147 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 20:34:53,148 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 20:34:53,148 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 20:34:53,148 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 20:34:53,148 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 20:34:53,148 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 20:34:53,148 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 20:34:53,149 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 20:34:53,149 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 20:34:53,149 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 20:34:53,149 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 20:34:53,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:34:53,151 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 20:34:53,151 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 20:34:53,151 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 20:34:53,151 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 20:34:53,152 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 20:34:53,152 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 20:34:53,152 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 -> 4a052330b4479085cb8bf5435fb8596eeb294355 [2018-12-31 20:34:53,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 20:34:53,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 20:34:53,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 20:34:53,207 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 20:34:53,207 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 20:34:53,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix034_rmo.oepc_false-unreach-call.i [2018-12-31 20:34:53,275 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2869563b1/cd9dd770a10445df8b28bdf82f37b477/FLAGd97178ae8 [2018-12-31 20:34:53,798 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 20:34:53,799 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix034_rmo.oepc_false-unreach-call.i [2018-12-31 20:34:53,815 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2869563b1/cd9dd770a10445df8b28bdf82f37b477/FLAGd97178ae8 [2018-12-31 20:34:54,066 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2869563b1/cd9dd770a10445df8b28bdf82f37b477 [2018-12-31 20:34:54,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 20:34:54,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 20:34:54,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 20:34:54,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 20:34:54,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 20:34:54,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:34:54" (1/1) ... [2018-12-31 20:34:54,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790f1a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54, skipping insertion in model container [2018-12-31 20:34:54,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 08:34:54" (1/1) ... [2018-12-31 20:34:54,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 20:34:54,158 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 20:34:54,637 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:34:54,662 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 20:34:54,826 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 20:34:54,909 INFO L195 MainTranslator]: Completed translation [2018-12-31 20:34:54,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54 WrapperNode [2018-12-31 20:34:54,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 20:34:54,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 20:34:54,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 20:34:54,911 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 20:34:54,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54" (1/1) ... [2018-12-31 20:34:54,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54" (1/1) ... [2018-12-31 20:34:54,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 20:34:54,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 20:34:54,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 20:34:54,992 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 20:34:55,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54" (1/1) ... [2018-12-31 20:34:55,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54" (1/1) ... [2018-12-31 20:34:55,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54" (1/1) ... [2018-12-31 20:34:55,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54" (1/1) ... [2018-12-31 20:34:55,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54" (1/1) ... [2018-12-31 20:34:55,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54" (1/1) ... [2018-12-31 20:34:55,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54" (1/1) ... [2018-12-31 20:34:55,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 20:34:55,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 20:34:55,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 20:34:55,038 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 20:34:55,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 20:34:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 20:34:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 20:34:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 20:34:55,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 20:34:55,116 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 20:34:55,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 20:34:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 20:34:55,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 20:34:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 20:34:55,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 20:34:55,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 20:34:55,119 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 20:34:56,345 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 20:34:56,345 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 20:34:56,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:34:56 BoogieIcfgContainer [2018-12-31 20:34:56,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 20:34:56,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 20:34:56,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 20:34:56,351 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 20:34:56,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 08:34:54" (1/3) ... [2018-12-31 20:34:56,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3cfaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:34:56, skipping insertion in model container [2018-12-31 20:34:56,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 08:34:54" (2/3) ... [2018-12-31 20:34:56,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3cfaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 08:34:56, skipping insertion in model container [2018-12-31 20:34:56,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:34:56" (3/3) ... [2018-12-31 20:34:56,355 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_rmo.oepc_false-unreach-call.i [2018-12-31 20:34:56,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,419 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,421 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,421 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,425 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,426 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,427 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,428 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,434 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,435 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,437 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,438 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,438 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,439 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,439 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,441 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,445 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,446 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,466 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 20:34:56,505 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 20:34:56,505 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 20:34:56,519 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 20:34:56,541 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 20:34:56,571 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 20:34:56,572 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 20:34:56,572 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 20:34:56,572 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 20:34:56,573 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 20:34:56,573 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 20:34:56,573 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 20:34:56,573 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 20:34:56,573 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 20:34:56,587 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 182 transitions [2018-12-31 20:34:59,336 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34808 states. [2018-12-31 20:34:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 34808 states. [2018-12-31 20:34:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 20:34:59,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:34:59,351 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] [2018-12-31 20:34:59,353 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:34:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:34:59,361 INFO L82 PathProgramCache]: Analyzing trace with hash 998748630, now seen corresponding path program 1 times [2018-12-31 20:34:59,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:34:59,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:34:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:34:59,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:34:59,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:34:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:34:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:34:59,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:34:59,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:34:59,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:34:59,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:34:59,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:34:59,771 INFO L87 Difference]: Start difference. First operand 34808 states. Second operand 4 states. [2018-12-31 20:35:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:01,465 INFO L93 Difference]: Finished difference Result 60792 states and 234495 transitions. [2018-12-31 20:35:01,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:35:01,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-31 20:35:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:01,864 INFO L225 Difference]: With dead ends: 60792 [2018-12-31 20:35:01,865 INFO L226 Difference]: Without dead ends: 44272 [2018-12-31 20:35:01,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44272 states. [2018-12-31 20:35:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44272 to 27340. [2018-12-31 20:35:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27340 states. [2018-12-31 20:35:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27340 states to 27340 states and 105501 transitions. [2018-12-31 20:35:03,835 INFO L78 Accepts]: Start accepts. Automaton has 27340 states and 105501 transitions. Word has length 35 [2018-12-31 20:35:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:03,837 INFO L480 AbstractCegarLoop]: Abstraction has 27340 states and 105501 transitions. [2018-12-31 20:35:03,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:35:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 27340 states and 105501 transitions. [2018-12-31 20:35:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 20:35:03,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:03,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:03,858 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:03,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:03,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1553228635, now seen corresponding path program 1 times [2018-12-31 20:35:03,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:03,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:03,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:03,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:04,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:04,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:04,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:04,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:04,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:04,108 INFO L87 Difference]: Start difference. First operand 27340 states and 105501 transitions. Second operand 5 states. [2018-12-31 20:35:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:06,503 INFO L93 Difference]: Finished difference Result 64006 states and 235336 transitions. [2018-12-31 20:35:06,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:35:06,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 20:35:06,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:07,408 INFO L225 Difference]: With dead ends: 64006 [2018-12-31 20:35:07,408 INFO L226 Difference]: Without dead ends: 63454 [2018-12-31 20:35:07,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:35:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63454 states. [2018-12-31 20:35:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63454 to 41422. [2018-12-31 20:35:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41422 states. [2018-12-31 20:35:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41422 states to 41422 states and 152331 transitions. [2018-12-31 20:35:08,854 INFO L78 Accepts]: Start accepts. Automaton has 41422 states and 152331 transitions. Word has length 47 [2018-12-31 20:35:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:08,855 INFO L480 AbstractCegarLoop]: Abstraction has 41422 states and 152331 transitions. [2018-12-31 20:35:08,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 41422 states and 152331 transitions. [2018-12-31 20:35:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 20:35:08,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:08,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:08,865 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:08,866 INFO L82 PathProgramCache]: Analyzing trace with hash -508045602, now seen corresponding path program 1 times [2018-12-31 20:35:08,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:08,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:08,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:08,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:08,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:09,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:09,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:09,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:09,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:09,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:09,044 INFO L87 Difference]: Start difference. First operand 41422 states and 152331 transitions. Second operand 5 states. [2018-12-31 20:35:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:10,695 INFO L93 Difference]: Finished difference Result 81368 states and 298049 transitions. [2018-12-31 20:35:10,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:35:10,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-31 20:35:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:10,972 INFO L225 Difference]: With dead ends: 81368 [2018-12-31 20:35:10,972 INFO L226 Difference]: Without dead ends: 80856 [2018-12-31 20:35:10,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:35:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80856 states. [2018-12-31 20:35:13,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80856 to 45376. [2018-12-31 20:35:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45376 states. [2018-12-31 20:35:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45376 states to 45376 states and 166019 transitions. [2018-12-31 20:35:13,397 INFO L78 Accepts]: Start accepts. Automaton has 45376 states and 166019 transitions. Word has length 48 [2018-12-31 20:35:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:13,398 INFO L480 AbstractCegarLoop]: Abstraction has 45376 states and 166019 transitions. [2018-12-31 20:35:13,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 45376 states and 166019 transitions. [2018-12-31 20:35:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 20:35:13,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:13,408 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] [2018-12-31 20:35:13,408 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1928335132, now seen corresponding path program 1 times [2018-12-31 20:35:13,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:13,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:13,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:13,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:13,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:13,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:35:13,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:35:13,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:35:13,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:35:13,488 INFO L87 Difference]: Start difference. First operand 45376 states and 166019 transitions. Second operand 3 states. [2018-12-31 20:35:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:13,832 INFO L93 Difference]: Finished difference Result 65252 states and 235815 transitions. [2018-12-31 20:35:13,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:35:13,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-31 20:35:13,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:13,996 INFO L225 Difference]: With dead ends: 65252 [2018-12-31 20:35:13,996 INFO L226 Difference]: Without dead ends: 65252 [2018-12-31 20:35:13,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:35:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65252 states. [2018-12-31 20:35:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65252 to 50946. [2018-12-31 20:35:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50946 states. [2018-12-31 20:35:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50946 states to 50946 states and 184326 transitions. [2018-12-31 20:35:15,227 INFO L78 Accepts]: Start accepts. Automaton has 50946 states and 184326 transitions. Word has length 50 [2018-12-31 20:35:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:15,228 INFO L480 AbstractCegarLoop]: Abstraction has 50946 states and 184326 transitions. [2018-12-31 20:35:15,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:35:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 50946 states and 184326 transitions. [2018-12-31 20:35:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 20:35:15,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:15,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:15,250 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:15,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash -433775087, now seen corresponding path program 1 times [2018-12-31 20:35:15,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:15,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:15,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:15,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:15,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:15,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:15,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:15,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:15,540 INFO L87 Difference]: Start difference. First operand 50946 states and 184326 transitions. Second operand 6 states. [2018-12-31 20:35:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:17,606 INFO L93 Difference]: Finished difference Result 67512 states and 242186 transitions. [2018-12-31 20:35:17,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:35:17,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-31 20:35:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:17,838 INFO L225 Difference]: With dead ends: 67512 [2018-12-31 20:35:17,838 INFO L226 Difference]: Without dead ends: 67512 [2018-12-31 20:35:17,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:35:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67512 states. [2018-12-31 20:35:19,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67512 to 63437. [2018-12-31 20:35:19,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63437 states. [2018-12-31 20:35:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63437 states to 63437 states and 227585 transitions. [2018-12-31 20:35:19,263 INFO L78 Accepts]: Start accepts. Automaton has 63437 states and 227585 transitions. Word has length 54 [2018-12-31 20:35:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:19,263 INFO L480 AbstractCegarLoop]: Abstraction has 63437 states and 227585 transitions. [2018-12-31 20:35:19,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 63437 states and 227585 transitions. [2018-12-31 20:35:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 20:35:19,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:19,283 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] [2018-12-31 20:35:19,283 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:19,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:19,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2064240850, now seen corresponding path program 1 times [2018-12-31 20:35:19,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:19,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:19,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:19,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:19,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:19,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:19,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:35:19,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:35:19,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:35:19,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:19,898 INFO L87 Difference]: Start difference. First operand 63437 states and 227585 transitions. Second operand 7 states. [2018-12-31 20:35:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:22,295 INFO L93 Difference]: Finished difference Result 88529 states and 306202 transitions. [2018-12-31 20:35:22,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 20:35:22,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-31 20:35:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:22,578 INFO L225 Difference]: With dead ends: 88529 [2018-12-31 20:35:22,578 INFO L226 Difference]: Without dead ends: 88529 [2018-12-31 20:35:22,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 20:35:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88529 states. [2018-12-31 20:35:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88529 to 74882. [2018-12-31 20:35:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74882 states. [2018-12-31 20:35:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74882 states to 74882 states and 262988 transitions. [2018-12-31 20:35:24,328 INFO L78 Accepts]: Start accepts. Automaton has 74882 states and 262988 transitions. Word has length 54 [2018-12-31 20:35:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:24,328 INFO L480 AbstractCegarLoop]: Abstraction has 74882 states and 262988 transitions. [2018-12-31 20:35:24,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:35:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 74882 states and 262988 transitions. [2018-12-31 20:35:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 20:35:24,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:24,345 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] [2018-12-31 20:35:24,345 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:24,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:24,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1343222765, now seen corresponding path program 1 times [2018-12-31 20:35:24,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:24,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:24,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:24,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:24,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:35:24,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:35:24,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:35:24,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:24,513 INFO L87 Difference]: Start difference. First operand 74882 states and 262988 transitions. Second operand 4 states. [2018-12-31 20:35:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:24,634 INFO L93 Difference]: Finished difference Result 15376 states and 48827 transitions. [2018-12-31 20:35:24,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:35:24,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-31 20:35:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:24,663 INFO L225 Difference]: With dead ends: 15376 [2018-12-31 20:35:24,664 INFO L226 Difference]: Without dead ends: 13790 [2018-12-31 20:35:24,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13790 states. [2018-12-31 20:35:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13790 to 13741. [2018-12-31 20:35:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13741 states. [2018-12-31 20:35:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13741 states to 13741 states and 43353 transitions. [2018-12-31 20:35:24,888 INFO L78 Accepts]: Start accepts. Automaton has 13741 states and 43353 transitions. Word has length 54 [2018-12-31 20:35:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:24,888 INFO L480 AbstractCegarLoop]: Abstraction has 13741 states and 43353 transitions. [2018-12-31 20:35:24,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:35:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 13741 states and 43353 transitions. [2018-12-31 20:35:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 20:35:24,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:24,891 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] [2018-12-31 20:35:24,891 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:24,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1510963439, now seen corresponding path program 1 times [2018-12-31 20:35:24,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:24,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:24,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:24,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:25,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:25,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:25,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:25,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:25,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:25,023 INFO L87 Difference]: Start difference. First operand 13741 states and 43353 transitions. Second operand 6 states. [2018-12-31 20:35:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:25,763 INFO L93 Difference]: Finished difference Result 19971 states and 62590 transitions. [2018-12-31 20:35:25,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:35:25,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-31 20:35:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:25,808 INFO L225 Difference]: With dead ends: 19971 [2018-12-31 20:35:25,808 INFO L226 Difference]: Without dead ends: 19899 [2018-12-31 20:35:25,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 20:35:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19899 states. [2018-12-31 20:35:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19899 to 14315. [2018-12-31 20:35:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14315 states. [2018-12-31 20:35:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14315 states to 14315 states and 45050 transitions. [2018-12-31 20:35:26,119 INFO L78 Accepts]: Start accepts. Automaton has 14315 states and 45050 transitions. Word has length 54 [2018-12-31 20:35:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:26,119 INFO L480 AbstractCegarLoop]: Abstraction has 14315 states and 45050 transitions. [2018-12-31 20:35:26,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 14315 states and 45050 transitions. [2018-12-31 20:35:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-31 20:35:26,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:26,124 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] [2018-12-31 20:35:26,124 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:26,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:26,125 INFO L82 PathProgramCache]: Analyzing trace with hash 516780875, now seen corresponding path program 1 times [2018-12-31 20:35:26,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:26,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:26,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:26,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:26,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:35:26,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:35:26,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:35:26,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:26,335 INFO L87 Difference]: Start difference. First operand 14315 states and 45050 transitions. Second operand 4 states. [2018-12-31 20:35:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:26,525 INFO L93 Difference]: Finished difference Result 16618 states and 52378 transitions. [2018-12-31 20:35:26,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:35:26,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-31 20:35:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:26,566 INFO L225 Difference]: With dead ends: 16618 [2018-12-31 20:35:26,567 INFO L226 Difference]: Without dead ends: 16618 [2018-12-31 20:35:26,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16618 states. [2018-12-31 20:35:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16618 to 15135. [2018-12-31 20:35:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15135 states. [2018-12-31 20:35:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15135 states to 15135 states and 47640 transitions. [2018-12-31 20:35:26,992 INFO L78 Accepts]: Start accepts. Automaton has 15135 states and 47640 transitions. Word has length 62 [2018-12-31 20:35:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:26,993 INFO L480 AbstractCegarLoop]: Abstraction has 15135 states and 47640 transitions. [2018-12-31 20:35:26,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:35:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 15135 states and 47640 transitions. [2018-12-31 20:35:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-31 20:35:26,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:26,999 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] [2018-12-31 20:35:27,000 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:27,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2035376086, now seen corresponding path program 1 times [2018-12-31 20:35:27,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:27,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:27,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:27,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:27,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:27,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:27,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:27,149 INFO L87 Difference]: Start difference. First operand 15135 states and 47640 transitions. Second operand 6 states. [2018-12-31 20:35:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:27,841 INFO L93 Difference]: Finished difference Result 28107 states and 88148 transitions. [2018-12-31 20:35:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:35:27,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-31 20:35:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:27,909 INFO L225 Difference]: With dead ends: 28107 [2018-12-31 20:35:27,909 INFO L226 Difference]: Without dead ends: 28036 [2018-12-31 20:35:27,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 20:35:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28036 states. [2018-12-31 20:35:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28036 to 17413. [2018-12-31 20:35:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17413 states. [2018-12-31 20:35:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 54314 transitions. [2018-12-31 20:35:28,253 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 54314 transitions. Word has length 62 [2018-12-31 20:35:28,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:28,253 INFO L480 AbstractCegarLoop]: Abstraction has 17413 states and 54314 transitions. [2018-12-31 20:35:28,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:28,254 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 54314 transitions. [2018-12-31 20:35:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 20:35:28,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:28,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:28,261 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:28,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:28,262 INFO L82 PathProgramCache]: Analyzing trace with hash 505162303, now seen corresponding path program 1 times [2018-12-31 20:35:28,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:28,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:28,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:28,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:28,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:28,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:28,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:35:28,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:35:28,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:35:28,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:28,514 INFO L87 Difference]: Start difference. First operand 17413 states and 54314 transitions. Second operand 4 states. [2018-12-31 20:35:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:29,461 INFO L93 Difference]: Finished difference Result 21357 states and 65803 transitions. [2018-12-31 20:35:29,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:35:29,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-31 20:35:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:29,518 INFO L225 Difference]: With dead ends: 21357 [2018-12-31 20:35:29,518 INFO L226 Difference]: Without dead ends: 21357 [2018-12-31 20:35:29,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21357 states. [2018-12-31 20:35:29,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21357 to 19307. [2018-12-31 20:35:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19307 states. [2018-12-31 20:35:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19307 states to 19307 states and 59693 transitions. [2018-12-31 20:35:29,860 INFO L78 Accepts]: Start accepts. Automaton has 19307 states and 59693 transitions. Word has length 66 [2018-12-31 20:35:29,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:29,860 INFO L480 AbstractCegarLoop]: Abstraction has 19307 states and 59693 transitions. [2018-12-31 20:35:29,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:35:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 19307 states and 59693 transitions. [2018-12-31 20:35:29,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 20:35:29,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:29,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:29,871 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:29,871 INFO L82 PathProgramCache]: Analyzing trace with hash 250425758, now seen corresponding path program 1 times [2018-12-31 20:35:29,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:29,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:29,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:29,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:29,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:29,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:35:29,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:35:29,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:35:29,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:35:29,997 INFO L87 Difference]: Start difference. First operand 19307 states and 59693 transitions. Second operand 3 states. [2018-12-31 20:35:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:30,590 INFO L93 Difference]: Finished difference Result 19947 states and 61432 transitions. [2018-12-31 20:35:30,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:35:30,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-31 20:35:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:30,628 INFO L225 Difference]: With dead ends: 19947 [2018-12-31 20:35:30,629 INFO L226 Difference]: Without dead ends: 19947 [2018-12-31 20:35:30,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:35:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19947 states. [2018-12-31 20:35:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19947 to 19647. [2018-12-31 20:35:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19647 states. [2018-12-31 20:35:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19647 states to 19647 states and 60609 transitions. [2018-12-31 20:35:30,940 INFO L78 Accepts]: Start accepts. Automaton has 19647 states and 60609 transitions. Word has length 66 [2018-12-31 20:35:30,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:30,940 INFO L480 AbstractCegarLoop]: Abstraction has 19647 states and 60609 transitions. [2018-12-31 20:35:30,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:35:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 19647 states and 60609 transitions. [2018-12-31 20:35:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:30,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:30,953 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] [2018-12-31 20:35:30,953 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash -356405788, now seen corresponding path program 1 times [2018-12-31 20:35:30,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:30,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:30,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:31,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:31,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:31,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:31,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:31,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:31,080 INFO L87 Difference]: Start difference. First operand 19647 states and 60609 transitions. Second operand 6 states. [2018-12-31 20:35:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:32,409 INFO L93 Difference]: Finished difference Result 23815 states and 72327 transitions. [2018-12-31 20:35:32,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:35:32,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-31 20:35:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:32,458 INFO L225 Difference]: With dead ends: 23815 [2018-12-31 20:35:32,459 INFO L226 Difference]: Without dead ends: 23815 [2018-12-31 20:35:32,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23815 states. [2018-12-31 20:35:32,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23815 to 22475. [2018-12-31 20:35:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22475 states. [2018-12-31 20:35:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22475 states to 22475 states and 68749 transitions. [2018-12-31 20:35:32,818 INFO L78 Accepts]: Start accepts. Automaton has 22475 states and 68749 transitions. Word has length 68 [2018-12-31 20:35:32,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:32,818 INFO L480 AbstractCegarLoop]: Abstraction has 22475 states and 68749 transitions. [2018-12-31 20:35:32,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 22475 states and 68749 transitions. [2018-12-31 20:35:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:32,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:32,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:32,832 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:32,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash -611142333, now seen corresponding path program 1 times [2018-12-31 20:35:32,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:32,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:32,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:32,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:32,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:33,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:33,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:33,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:33,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:33,127 INFO L87 Difference]: Start difference. First operand 22475 states and 68749 transitions. Second operand 6 states. [2018-12-31 20:35:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:33,707 INFO L93 Difference]: Finished difference Result 25703 states and 76209 transitions. [2018-12-31 20:35:33,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:35:33,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-31 20:35:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:33,774 INFO L225 Difference]: With dead ends: 25703 [2018-12-31 20:35:33,774 INFO L226 Difference]: Without dead ends: 25703 [2018-12-31 20:35:33,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:35:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2018-12-31 20:35:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 22859. [2018-12-31 20:35:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22859 states. [2018-12-31 20:35:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22859 states to 22859 states and 68855 transitions. [2018-12-31 20:35:34,459 INFO L78 Accepts]: Start accepts. Automaton has 22859 states and 68855 transitions. Word has length 68 [2018-12-31 20:35:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:34,459 INFO L480 AbstractCegarLoop]: Abstraction has 22859 states and 68855 transitions. [2018-12-31 20:35:34,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 22859 states and 68855 transitions. [2018-12-31 20:35:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:34,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:34,472 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] [2018-12-31 20:35:34,473 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:34,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash -678149086, now seen corresponding path program 1 times [2018-12-31 20:35:34,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:34,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:34,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:34,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:34,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:34,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:34,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:34,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:34,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:34,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:34,693 INFO L87 Difference]: Start difference. First operand 22859 states and 68855 transitions. Second operand 5 states. [2018-12-31 20:35:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:35,238 INFO L93 Difference]: Finished difference Result 29794 states and 89420 transitions. [2018-12-31 20:35:35,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:35:35,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-31 20:35:35,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:35,294 INFO L225 Difference]: With dead ends: 29794 [2018-12-31 20:35:35,294 INFO L226 Difference]: Without dead ends: 29794 [2018-12-31 20:35:35,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29794 states. [2018-12-31 20:35:35,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29794 to 26815. [2018-12-31 20:35:35,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26815 states. [2018-12-31 20:35:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26815 states to 26815 states and 80364 transitions. [2018-12-31 20:35:35,728 INFO L78 Accepts]: Start accepts. Automaton has 26815 states and 80364 transitions. Word has length 68 [2018-12-31 20:35:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:35,728 INFO L480 AbstractCegarLoop]: Abstraction has 26815 states and 80364 transitions. [2018-12-31 20:35:35,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 26815 states and 80364 transitions. [2018-12-31 20:35:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:35,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:35,744 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] [2018-12-31 20:35:35,744 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:35,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:35,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1188683263, now seen corresponding path program 1 times [2018-12-31 20:35:35,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:35,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:35,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:35,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:35,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:36,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:36,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:36,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:36,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:36,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:36,164 INFO L87 Difference]: Start difference. First operand 26815 states and 80364 transitions. Second operand 5 states. [2018-12-31 20:35:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:36,847 INFO L93 Difference]: Finished difference Result 36421 states and 108434 transitions. [2018-12-31 20:35:36,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:35:36,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-31 20:35:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:36,907 INFO L225 Difference]: With dead ends: 36421 [2018-12-31 20:35:36,908 INFO L226 Difference]: Without dead ends: 36421 [2018-12-31 20:35:36,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:35:36,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36421 states. [2018-12-31 20:35:37,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36421 to 29429. [2018-12-31 20:35:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29429 states. [2018-12-31 20:35:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29429 states to 29429 states and 87840 transitions. [2018-12-31 20:35:37,363 INFO L78 Accepts]: Start accepts. Automaton has 29429 states and 87840 transitions. Word has length 68 [2018-12-31 20:35:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:37,363 INFO L480 AbstractCegarLoop]: Abstraction has 29429 states and 87840 transitions. [2018-12-31 20:35:37,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 29429 states and 87840 transitions. [2018-12-31 20:35:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:37,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:37,374 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] [2018-12-31 20:35:37,374 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:37,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1298829570, now seen corresponding path program 1 times [2018-12-31 20:35:37,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:37,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:37,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:37,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:37,628 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 20:35:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:37,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:37,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:37,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:37,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:37,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:37,737 INFO L87 Difference]: Start difference. First operand 29429 states and 87840 transitions. Second operand 6 states. [2018-12-31 20:35:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:37,987 INFO L93 Difference]: Finished difference Result 28041 states and 79299 transitions. [2018-12-31 20:35:37,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:35:37,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-31 20:35:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:38,033 INFO L225 Difference]: With dead ends: 28041 [2018-12-31 20:35:38,033 INFO L226 Difference]: Without dead ends: 28041 [2018-12-31 20:35:38,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28041 states. [2018-12-31 20:35:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28041 to 23993. [2018-12-31 20:35:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23993 states. [2018-12-31 20:35:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23993 states to 23993 states and 68156 transitions. [2018-12-31 20:35:38,401 INFO L78 Accepts]: Start accepts. Automaton has 23993 states and 68156 transitions. Word has length 68 [2018-12-31 20:35:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:38,402 INFO L480 AbstractCegarLoop]: Abstraction has 23993 states and 68156 transitions. [2018-12-31 20:35:38,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 23993 states and 68156 transitions. [2018-12-31 20:35:38,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:38,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:38,412 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] [2018-12-31 20:35:38,412 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:38,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash 389381892, now seen corresponding path program 1 times [2018-12-31 20:35:38,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:38,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:38,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:38,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:38,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:38,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:38,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:38,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:38,570 INFO L87 Difference]: Start difference. First operand 23993 states and 68156 transitions. Second operand 5 states. [2018-12-31 20:35:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:38,634 INFO L93 Difference]: Finished difference Result 7181 states and 17283 transitions. [2018-12-31 20:35:38,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 20:35:38,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-31 20:35:38,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:38,643 INFO L225 Difference]: With dead ends: 7181 [2018-12-31 20:35:38,643 INFO L226 Difference]: Without dead ends: 5896 [2018-12-31 20:35:38,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5896 states. [2018-12-31 20:35:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5896 to 5236. [2018-12-31 20:35:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5236 states. [2018-12-31 20:35:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 12141 transitions. [2018-12-31 20:35:38,707 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 12141 transitions. Word has length 68 [2018-12-31 20:35:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:38,707 INFO L480 AbstractCegarLoop]: Abstraction has 5236 states and 12141 transitions. [2018-12-31 20:35:38,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 12141 transitions. [2018-12-31 20:35:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 20:35:38,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:38,713 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] [2018-12-31 20:35:38,713 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash -342568837, now seen corresponding path program 1 times [2018-12-31 20:35:38,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:38,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:38,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:38,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:38,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:38,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 20:35:38,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 20:35:38,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 20:35:38,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:35:38,792 INFO L87 Difference]: Start difference. First operand 5236 states and 12141 transitions. Second operand 3 states. [2018-12-31 20:35:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:39,027 INFO L93 Difference]: Finished difference Result 6577 states and 15019 transitions. [2018-12-31 20:35:39,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 20:35:39,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-31 20:35:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:39,040 INFO L225 Difference]: With dead ends: 6577 [2018-12-31 20:35:39,040 INFO L226 Difference]: Without dead ends: 6577 [2018-12-31 20:35:39,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 20:35:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2018-12-31 20:35:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 5175. [2018-12-31 20:35:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5175 states. [2018-12-31 20:35:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 11681 transitions. [2018-12-31 20:35:39,134 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 11681 transitions. Word has length 68 [2018-12-31 20:35:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:39,135 INFO L480 AbstractCegarLoop]: Abstraction has 5175 states and 11681 transitions. [2018-12-31 20:35:39,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 20:35:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 11681 transitions. [2018-12-31 20:35:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-31 20:35:39,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:39,145 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] [2018-12-31 20:35:39,145 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:39,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:39,145 INFO L82 PathProgramCache]: Analyzing trace with hash -571353426, now seen corresponding path program 1 times [2018-12-31 20:35:39,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:39,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:39,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:39,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:39,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:39,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:39,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:39,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:39,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:39,509 INFO L87 Difference]: Start difference. First operand 5175 states and 11681 transitions. Second operand 5 states. [2018-12-31 20:35:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:40,235 INFO L93 Difference]: Finished difference Result 6325 states and 14274 transitions. [2018-12-31 20:35:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 20:35:40,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-31 20:35:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:40,245 INFO L225 Difference]: With dead ends: 6325 [2018-12-31 20:35:40,245 INFO L226 Difference]: Without dead ends: 6325 [2018-12-31 20:35:40,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:35:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6325 states. [2018-12-31 20:35:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6325 to 5619. [2018-12-31 20:35:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5619 states. [2018-12-31 20:35:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 12685 transitions. [2018-12-31 20:35:40,312 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 12685 transitions. Word has length 74 [2018-12-31 20:35:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:40,312 INFO L480 AbstractCegarLoop]: Abstraction has 5619 states and 12685 transitions. [2018-12-31 20:35:40,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 12685 transitions. [2018-12-31 20:35:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-31 20:35:40,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:40,318 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] [2018-12-31 20:35:40,319 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:40,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:40,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1171456909, now seen corresponding path program 1 times [2018-12-31 20:35:40,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:40,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:40,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:40,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:40,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:40,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:40,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:40,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:35:40,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:35:40,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:35:40,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:40,827 INFO L87 Difference]: Start difference. First operand 5619 states and 12685 transitions. Second operand 7 states. [2018-12-31 20:35:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:42,622 INFO L93 Difference]: Finished difference Result 6586 states and 14710 transitions. [2018-12-31 20:35:42,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:35:42,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-31 20:35:42,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:42,631 INFO L225 Difference]: With dead ends: 6586 [2018-12-31 20:35:42,632 INFO L226 Difference]: Without dead ends: 6484 [2018-12-31 20:35:42,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 20:35:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2018-12-31 20:35:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 5716. [2018-12-31 20:35:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5716 states. [2018-12-31 20:35:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 12778 transitions. [2018-12-31 20:35:42,702 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 12778 transitions. Word has length 74 [2018-12-31 20:35:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:42,703 INFO L480 AbstractCegarLoop]: Abstraction has 5716 states and 12778 transitions. [2018-12-31 20:35:42,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:35:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 12778 transitions. [2018-12-31 20:35:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 20:35:42,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:42,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:42,710 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2144466605, now seen corresponding path program 1 times [2018-12-31 20:35:42,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:42,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:42,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:42,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:42,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:42,869 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 20:35:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:43,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:43,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:35:43,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:35:43,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:35:43,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:43,080 INFO L87 Difference]: Start difference. First operand 5716 states and 12778 transitions. Second operand 7 states. [2018-12-31 20:35:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:43,959 INFO L93 Difference]: Finished difference Result 7199 states and 16113 transitions. [2018-12-31 20:35:43,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:35:43,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-31 20:35:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:43,970 INFO L225 Difference]: With dead ends: 7199 [2018-12-31 20:35:43,971 INFO L226 Difference]: Without dead ends: 7199 [2018-12-31 20:35:43,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7199 states. [2018-12-31 20:35:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7199 to 5856. [2018-12-31 20:35:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5856 states. [2018-12-31 20:35:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5856 states to 5856 states and 13166 transitions. [2018-12-31 20:35:44,051 INFO L78 Accepts]: Start accepts. Automaton has 5856 states and 13166 transitions. Word has length 95 [2018-12-31 20:35:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:44,052 INFO L480 AbstractCegarLoop]: Abstraction has 5856 states and 13166 transitions. [2018-12-31 20:35:44,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:35:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 5856 states and 13166 transitions. [2018-12-31 20:35:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 20:35:44,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:44,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:44,061 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:44,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:44,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1598659536, now seen corresponding path program 1 times [2018-12-31 20:35:44,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:44,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:44,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:44,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:44,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:44,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:44,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:35:44,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:35:44,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:35:44,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:44,173 INFO L87 Difference]: Start difference. First operand 5856 states and 13166 transitions. Second operand 4 states. [2018-12-31 20:35:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:44,302 INFO L93 Difference]: Finished difference Result 6980 states and 15568 transitions. [2018-12-31 20:35:44,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 20:35:44,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-31 20:35:44,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:44,311 INFO L225 Difference]: With dead ends: 6980 [2018-12-31 20:35:44,311 INFO L226 Difference]: Without dead ends: 6980 [2018-12-31 20:35:44,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:44,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2018-12-31 20:35:44,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 6213. [2018-12-31 20:35:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2018-12-31 20:35:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 13936 transitions. [2018-12-31 20:35:44,389 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 13936 transitions. Word has length 95 [2018-12-31 20:35:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:44,390 INFO L480 AbstractCegarLoop]: Abstraction has 6213 states and 13936 transitions. [2018-12-31 20:35:44,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:35:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 13936 transitions. [2018-12-31 20:35:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:44,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:44,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:44,400 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:44,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1803412790, now seen corresponding path program 1 times [2018-12-31 20:35:44,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:44,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:44,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:44,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:44,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:44,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:44,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:44,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:44,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:44,684 INFO L87 Difference]: Start difference. First operand 6213 states and 13936 transitions. Second operand 5 states. [2018-12-31 20:35:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:44,810 INFO L93 Difference]: Finished difference Result 6659 states and 14882 transitions. [2018-12-31 20:35:44,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:35:44,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-31 20:35:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:44,819 INFO L225 Difference]: With dead ends: 6659 [2018-12-31 20:35:44,819 INFO L226 Difference]: Without dead ends: 6659 [2018-12-31 20:35:44,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2018-12-31 20:35:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 5109. [2018-12-31 20:35:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5109 states. [2018-12-31 20:35:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 11452 transitions. [2018-12-31 20:35:44,894 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 11452 transitions. Word has length 97 [2018-12-31 20:35:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:44,894 INFO L480 AbstractCegarLoop]: Abstraction has 5109 states and 11452 transitions. [2018-12-31 20:35:44,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 11452 transitions. [2018-12-31 20:35:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:44,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:44,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:44,901 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:44,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1814728917, now seen corresponding path program 1 times [2018-12-31 20:35:44,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:44,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:44,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:44,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:44,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:45,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:45,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 20:35:45,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 20:35:45,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 20:35:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 20:35:45,173 INFO L87 Difference]: Start difference. First operand 5109 states and 11452 transitions. Second operand 4 states. [2018-12-31 20:35:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:45,493 INFO L93 Difference]: Finished difference Result 6613 states and 14743 transitions. [2018-12-31 20:35:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 20:35:45,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-31 20:35:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:45,504 INFO L225 Difference]: With dead ends: 6613 [2018-12-31 20:35:45,504 INFO L226 Difference]: Without dead ends: 6566 [2018-12-31 20:35:45,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6566 states. [2018-12-31 20:35:45,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6566 to 6157. [2018-12-31 20:35:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6157 states. [2018-12-31 20:35:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6157 states to 6157 states and 13768 transitions. [2018-12-31 20:35:45,602 INFO L78 Accepts]: Start accepts. Automaton has 6157 states and 13768 transitions. Word has length 97 [2018-12-31 20:35:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:45,603 INFO L480 AbstractCegarLoop]: Abstraction has 6157 states and 13768 transitions. [2018-12-31 20:35:45,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 20:35:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6157 states and 13768 transitions. [2018-12-31 20:35:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:45,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:45,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:45,612 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:45,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:45,612 INFO L82 PathProgramCache]: Analyzing trace with hash -262480426, now seen corresponding path program 1 times [2018-12-31 20:35:45,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:45,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:45,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:45,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:45,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:45,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:45,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 20:35:45,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 20:35:45,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 20:35:45,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:35:45,861 INFO L87 Difference]: Start difference. First operand 6157 states and 13768 transitions. Second operand 9 states. [2018-12-31 20:35:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:46,663 INFO L93 Difference]: Finished difference Result 7878 states and 17405 transitions. [2018-12-31 20:35:46,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 20:35:46,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2018-12-31 20:35:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:46,675 INFO L225 Difference]: With dead ends: 7878 [2018-12-31 20:35:46,675 INFO L226 Difference]: Without dead ends: 7878 [2018-12-31 20:35:46,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-31 20:35:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2018-12-31 20:35:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 6683. [2018-12-31 20:35:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6683 states. [2018-12-31 20:35:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6683 states to 6683 states and 14838 transitions. [2018-12-31 20:35:46,764 INFO L78 Accepts]: Start accepts. Automaton has 6683 states and 14838 transitions. Word has length 97 [2018-12-31 20:35:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:46,764 INFO L480 AbstractCegarLoop]: Abstraction has 6683 states and 14838 transitions. [2018-12-31 20:35:46,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 20:35:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 6683 states and 14838 transitions. [2018-12-31 20:35:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:46,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:46,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:46,773 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:46,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:46,773 INFO L82 PathProgramCache]: Analyzing trace with hash -51129513, now seen corresponding path program 1 times [2018-12-31 20:35:46,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:46,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:46,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:47,054 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 20:35:47,229 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 20:35:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:47,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:47,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 20:35:47,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 20:35:47,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 20:35:47,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:35:47,880 INFO L87 Difference]: Start difference. First operand 6683 states and 14838 transitions. Second operand 11 states. [2018-12-31 20:35:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:49,766 INFO L93 Difference]: Finished difference Result 12276 states and 27352 transitions. [2018-12-31 20:35:49,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 20:35:49,768 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2018-12-31 20:35:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:49,780 INFO L225 Difference]: With dead ends: 12276 [2018-12-31 20:35:49,780 INFO L226 Difference]: Without dead ends: 8479 [2018-12-31 20:35:49,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 20:35:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8479 states. [2018-12-31 20:35:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8479 to 6439. [2018-12-31 20:35:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6439 states. [2018-12-31 20:35:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6439 states to 6439 states and 14285 transitions. [2018-12-31 20:35:49,954 INFO L78 Accepts]: Start accepts. Automaton has 6439 states and 14285 transitions. Word has length 97 [2018-12-31 20:35:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:49,954 INFO L480 AbstractCegarLoop]: Abstraction has 6439 states and 14285 transitions. [2018-12-31 20:35:49,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 20:35:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6439 states and 14285 transitions. [2018-12-31 20:35:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:49,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:49,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:49,962 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:49,963 INFO L82 PathProgramCache]: Analyzing trace with hash 746604445, now seen corresponding path program 1 times [2018-12-31 20:35:49,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:49,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:49,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:49,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:49,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:50,402 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 20:35:50,830 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 20:35:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:50,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:50,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 20:35:50,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 20:35:50,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 20:35:50,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 20:35:50,847 INFO L87 Difference]: Start difference. First operand 6439 states and 14285 transitions. Second operand 6 states. [2018-12-31 20:35:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:51,031 INFO L93 Difference]: Finished difference Result 7393 states and 16150 transitions. [2018-12-31 20:35:51,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 20:35:51,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-31 20:35:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:51,042 INFO L225 Difference]: With dead ends: 7393 [2018-12-31 20:35:51,042 INFO L226 Difference]: Without dead ends: 7362 [2018-12-31 20:35:51,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7362 states. [2018-12-31 20:35:51,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7362 to 6492. [2018-12-31 20:35:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6492 states. [2018-12-31 20:35:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 14216 transitions. [2018-12-31 20:35:51,130 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 14216 transitions. Word has length 97 [2018-12-31 20:35:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:51,131 INFO L480 AbstractCegarLoop]: Abstraction has 6492 states and 14216 transitions. [2018-12-31 20:35:51,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 20:35:51,131 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 14216 transitions. [2018-12-31 20:35:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:51,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:51,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:51,142 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -439969543, now seen corresponding path program 1 times [2018-12-31 20:35:51,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:51,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:51,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:51,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 20:35:51,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 20:35:51,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 20:35:51,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 20:35:51,260 INFO L87 Difference]: Start difference. First operand 6492 states and 14216 transitions. Second operand 5 states. [2018-12-31 20:35:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:51,527 INFO L93 Difference]: Finished difference Result 7692 states and 16739 transitions. [2018-12-31 20:35:51,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 20:35:51,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-31 20:35:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:51,540 INFO L225 Difference]: With dead ends: 7692 [2018-12-31 20:35:51,540 INFO L226 Difference]: Without dead ends: 7605 [2018-12-31 20:35:51,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:35:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7605 states. [2018-12-31 20:35:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7605 to 6147. [2018-12-31 20:35:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6147 states. [2018-12-31 20:35:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 13534 transitions. [2018-12-31 20:35:51,629 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 13534 transitions. Word has length 97 [2018-12-31 20:35:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:51,629 INFO L480 AbstractCegarLoop]: Abstraction has 6147 states and 13534 transitions. [2018-12-31 20:35:51,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 20:35:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 13534 transitions. [2018-12-31 20:35:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:51,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:51,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:51,637 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:51,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1423115111, now seen corresponding path program 2 times [2018-12-31 20:35:51,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:51,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:51,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:51,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:51,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:52,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:52,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 20:35:52,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 20:35:52,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 20:35:52,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 20:35:52,060 INFO L87 Difference]: Start difference. First operand 6147 states and 13534 transitions. Second operand 9 states. [2018-12-31 20:35:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:52,773 INFO L93 Difference]: Finished difference Result 6889 states and 15104 transitions. [2018-12-31 20:35:52,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:35:52,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2018-12-31 20:35:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:52,784 INFO L225 Difference]: With dead ends: 6889 [2018-12-31 20:35:52,784 INFO L226 Difference]: Without dead ends: 6882 [2018-12-31 20:35:52,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:35:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2018-12-31 20:35:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 6286. [2018-12-31 20:35:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6286 states. [2018-12-31 20:35:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 13832 transitions. [2018-12-31 20:35:52,863 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 13832 transitions. Word has length 97 [2018-12-31 20:35:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:52,864 INFO L480 AbstractCegarLoop]: Abstraction has 6286 states and 13832 transitions. [2018-12-31 20:35:52,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 20:35:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 13832 transitions. [2018-12-31 20:35:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:52,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:52,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:52,872 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:52,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1211764198, now seen corresponding path program 1 times [2018-12-31 20:35:52,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:52,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:52,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:52,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:35:52,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:53,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:53,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 20:35:53,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 20:35:53,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 20:35:53,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 20:35:53,465 INFO L87 Difference]: Start difference. First operand 6286 states and 13832 transitions. Second operand 7 states. [2018-12-31 20:35:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:53,947 INFO L93 Difference]: Finished difference Result 8076 states and 17595 transitions. [2018-12-31 20:35:53,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 20:35:53,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-31 20:35:53,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:53,959 INFO L225 Difference]: With dead ends: 8076 [2018-12-31 20:35:53,959 INFO L226 Difference]: Without dead ends: 8076 [2018-12-31 20:35:53,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 20:35:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8076 states. [2018-12-31 20:35:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8076 to 6350. [2018-12-31 20:35:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6350 states. [2018-12-31 20:35:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6350 states to 6350 states and 13979 transitions. [2018-12-31 20:35:54,044 INFO L78 Accepts]: Start accepts. Automaton has 6350 states and 13979 transitions. Word has length 97 [2018-12-31 20:35:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:54,044 INFO L480 AbstractCegarLoop]: Abstraction has 6350 states and 13979 transitions. [2018-12-31 20:35:54,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 20:35:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 6350 states and 13979 transitions. [2018-12-31 20:35:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:54,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:54,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:54,052 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:54,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:54,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1915558852, now seen corresponding path program 2 times [2018-12-31 20:35:54,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:54,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:54,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:54,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 20:35:54,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 20:35:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 20:35:54,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 20:35:54,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 20:35:54,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 20:35:54,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 20:35:54,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 20:35:54,300 INFO L87 Difference]: Start difference. First operand 6350 states and 13979 transitions. Second operand 8 states. [2018-12-31 20:35:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 20:35:54,824 INFO L93 Difference]: Finished difference Result 8172 states and 17759 transitions. [2018-12-31 20:35:54,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 20:35:54,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2018-12-31 20:35:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 20:35:54,836 INFO L225 Difference]: With dead ends: 8172 [2018-12-31 20:35:54,837 INFO L226 Difference]: Without dead ends: 8172 [2018-12-31 20:35:54,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-12-31 20:35:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8172 states. [2018-12-31 20:35:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8172 to 6484. [2018-12-31 20:35:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6484 states. [2018-12-31 20:35:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6484 states to 6484 states and 14288 transitions. [2018-12-31 20:35:54,923 INFO L78 Accepts]: Start accepts. Automaton has 6484 states and 14288 transitions. Word has length 97 [2018-12-31 20:35:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 20:35:54,924 INFO L480 AbstractCegarLoop]: Abstraction has 6484 states and 14288 transitions. [2018-12-31 20:35:54,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 20:35:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states and 14288 transitions. [2018-12-31 20:35:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-31 20:35:54,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 20:35:54,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 20:35:54,932 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 20:35:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 20:35:54,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1704207939, now seen corresponding path program 2 times [2018-12-31 20:35:54,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 20:35:54,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 20:35:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:54,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 20:35:54,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 20:35:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:35:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 20:35:55,033 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 20:35:55,243 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 20:35:55,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 08:35:55 BasicIcfg [2018-12-31 20:35:55,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 20:35:55,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 20:35:55,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 20:35:55,247 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 20:35:55,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 08:34:56" (3/4) ... [2018-12-31 20:35:55,258 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 20:35:55,478 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 20:35:55,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 20:35:55,484 INFO L168 Benchmark]: Toolchain (without parser) took 61411.73 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 942.0 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-31 20:35:55,486 INFO L168 Benchmark]: CDTParser took 0.19 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. [2018-12-31 20:35:55,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 20:35:55,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 20:35:55,488 INFO L168 Benchmark]: Boogie Preprocessor took 45.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 20:35:55,488 INFO L168 Benchmark]: RCFGBuilder took 1308.16 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-31 20:35:55,489 INFO L168 Benchmark]: TraceAbstraction took 58898.82 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-31 20:35:55,489 INFO L168 Benchmark]: Witness Printer took 236.53 ms. Allocated memory is still 3.9 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. [2018-12-31 20:35:55,494 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.19 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 835.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.27 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 1308.16 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58898.82 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 236.53 ms. Allocated memory is still 3.9 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L686] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L687] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L688] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L689] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L690] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L691] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L692] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L693] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L694] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L695] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L696] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L697] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L698] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L699] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L700] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L701] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] -1 pthread_t t907; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] FCALL, FORK -1 pthread_create(&t907, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L705] 0 z$w_buff1 = z$w_buff0 [L706] 0 z$w_buff0 = 1 [L707] 0 z$w_buff1_used = z$w_buff0_used [L708] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L710] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L711] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L712] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L713] 0 z$r_buff0_thd1 = (_Bool)1 [L716] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] -1 pthread_t t908; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] FCALL, FORK -1 pthread_create(&t908, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 x = 1 [L736] 1 y = 1 [L739] 1 __unbuffered_p1_EAX = y [L742] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L743] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L744] 1 z$flush_delayed = weak$$choice2 [L745] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L747] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L748] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L749] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L752] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L722] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L722] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L723] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L726] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z = z$flush_delayed ? z$mem_tmp : z [L755] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L791] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L792] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L793] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L796] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 224 locations, 3 error locations. UNSAFE Result, 58.6s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 29.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9077 SDtfs, 10520 SDslu, 20847 SDs, 0 SdLazy, 9506 SolverSat, 502 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 78 SyntacticMatches, 33 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74882occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 15.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 161942 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 2436 NumberOfCodeBlocks, 2436 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2307 ConstructedInterpolants, 0 QuantifiedInterpolants, 470146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...