./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi003_pso.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/rfi003_pso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73df3d994267c42eb7b3d426a71db570dbf7c4f8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 22:48:00,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 22:48:00,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 22:48:00,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 22:48:00,922 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 22:48:00,925 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 22:48:00,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 22:48:00,929 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 22:48:00,933 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 22:48:00,934 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 22:48:00,936 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 22:48:00,937 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 22:48:00,938 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 22:48:00,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 22:48:00,940 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 22:48:00,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 22:48:00,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 22:48:00,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 22:48:00,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 22:48:00,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 22:48:00,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 22:48:00,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 22:48:00,954 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 22:48:00,959 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 22:48:00,959 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 22:48:00,960 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 22:48:00,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 22:48:00,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 22:48:00,965 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 22:48:00,966 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 22:48:00,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 22:48:00,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 22:48:00,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 22:48:00,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 22:48:00,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 22:48:00,974 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 22:48:00,974 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 22:48:00,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 22:48:00,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 22:48:00,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 22:48:00,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 22:48:00,991 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 22:48:00,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 22:48:00,991 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 22:48:00,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 22:48:00,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 22:48:00,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 22:48:00,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 22:48:00,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 22:48:00,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 22:48:00,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 22:48:00,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 22:48:00,993 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 22:48:00,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 22:48:00,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 22:48:00,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 22:48:00,994 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 22:48:00,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 22:48:00,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 22:48:00,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 22:48:00,995 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 22:48:00,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 22:48:00,995 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 22:48:00,995 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 22:48:00,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 22:48:00,995 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 -> 73df3d994267c42eb7b3d426a71db570dbf7c4f8 [2018-12-31 22:48:01,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 22:48:01,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 22:48:01,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 22:48:01,066 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 22:48:01,067 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 22:48:01,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi003_pso.oepc_false-unreach-call.i [2018-12-31 22:48:01,138 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21db8b1e9/7601b8e905ce417ea65f557e5e4d6219/FLAG54330db67 [2018-12-31 22:48:01,770 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 22:48:01,771 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi003_pso.oepc_false-unreach-call.i [2018-12-31 22:48:01,803 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21db8b1e9/7601b8e905ce417ea65f557e5e4d6219/FLAG54330db67 [2018-12-31 22:48:02,017 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21db8b1e9/7601b8e905ce417ea65f557e5e4d6219 [2018-12-31 22:48:02,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 22:48:02,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 22:48:02,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 22:48:02,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 22:48:02,033 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 22:48:02,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:48:02" (1/1) ... [2018-12-31 22:48:02,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7307a100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:02, skipping insertion in model container [2018-12-31 22:48:02,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:48:02" (1/1) ... [2018-12-31 22:48:02,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 22:48:02,124 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 22:48:02,671 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:48:02,698 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 22:48:02,917 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 22:48:03,008 INFO L195 MainTranslator]: Completed translation [2018-12-31 22:48:03,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03 WrapperNode [2018-12-31 22:48:03,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 22:48:03,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 22:48:03,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 22:48:03,010 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 22:48:03,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03" (1/1) ... [2018-12-31 22:48:03,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03" (1/1) ... [2018-12-31 22:48:03,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 22:48:03,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 22:48:03,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 22:48:03,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 22:48:03,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03" (1/1) ... [2018-12-31 22:48:03,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03" (1/1) ... [2018-12-31 22:48:03,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03" (1/1) ... [2018-12-31 22:48:03,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03" (1/1) ... [2018-12-31 22:48:03,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03" (1/1) ... [2018-12-31 22:48:03,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03" (1/1) ... [2018-12-31 22:48:03,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03" (1/1) ... [2018-12-31 22:48:03,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 22:48:03,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 22:48:03,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 22:48:03,189 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 22:48:03,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03" (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 22:48:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 22:48:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 22:48:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 22:48:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 22:48:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 22:48:03,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 22:48:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 22:48:03,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 22:48:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 22:48:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 22:48:03,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 22:48:03,258 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 22:48:04,326 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 22:48:04,327 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 22:48:04,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:48:04 BoogieIcfgContainer [2018-12-31 22:48:04,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 22:48:04,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 22:48:04,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 22:48:04,335 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 22:48:04,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:48:02" (1/3) ... [2018-12-31 22:48:04,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782b1a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:48:04, skipping insertion in model container [2018-12-31 22:48:04,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:48:03" (2/3) ... [2018-12-31 22:48:04,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782b1a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:48:04, skipping insertion in model container [2018-12-31 22:48:04,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:48:04" (3/3) ... [2018-12-31 22:48:04,340 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_pso.oepc_false-unreach-call.i [2018-12-31 22:48:04,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,386 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,387 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,407 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,407 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,407 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,407 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,408 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,408 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,408 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,409 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,409 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,409 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,409 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,409 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 22:48:04,445 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 22:48:04,445 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 22:48:04,455 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 22:48:04,475 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 22:48:04,505 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 22:48:04,506 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 22:48:04,506 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 22:48:04,506 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 22:48:04,506 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 22:48:04,507 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 22:48:04,507 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 22:48:04,507 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 22:48:04,507 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 22:48:04,524 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131places, 163 transitions [2018-12-31 22:48:06,924 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27855 states. [2018-12-31 22:48:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states. [2018-12-31 22:48:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 22:48:06,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:06,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:06,943 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:06,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:06,951 INFO L82 PathProgramCache]: Analyzing trace with hash 71244223, now seen corresponding path program 1 times [2018-12-31 22:48:06,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:06,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:07,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:07,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:07,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:07,320 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 22:48:07,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:07,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:07,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:07,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:07,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:07,345 INFO L87 Difference]: Start difference. First operand 27855 states. Second operand 4 states. [2018-12-31 22:48:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:08,652 INFO L93 Difference]: Finished difference Result 47767 states and 183118 transitions. [2018-12-31 22:48:08,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:48:08,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-31 22:48:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:09,040 INFO L225 Difference]: With dead ends: 47767 [2018-12-31 22:48:09,041 INFO L226 Difference]: Without dead ends: 34607 [2018-12-31 22:48:09,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34607 states. [2018-12-31 22:48:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34607 to 21755. [2018-12-31 22:48:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21755 states. [2018-12-31 22:48:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 83440 transitions. [2018-12-31 22:48:10,623 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 83440 transitions. Word has length 38 [2018-12-31 22:48:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:10,625 INFO L480 AbstractCegarLoop]: Abstraction has 21755 states and 83440 transitions. [2018-12-31 22:48:10,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 83440 transitions. [2018-12-31 22:48:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 22:48:10,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:10,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:10,655 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:10,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:10,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1724990409, now seen corresponding path program 1 times [2018-12-31 22:48:10,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:10,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:10,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:10,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:10,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:11,014 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 22:48:11,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:11,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:11,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:11,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:11,018 INFO L87 Difference]: Start difference. First operand 21755 states and 83440 transitions. Second operand 5 states. [2018-12-31 22:48:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:13,825 INFO L93 Difference]: Finished difference Result 47633 states and 173801 transitions. [2018-12-31 22:48:13,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:13,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 22:48:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:14,093 INFO L225 Difference]: With dead ends: 47633 [2018-12-31 22:48:14,094 INFO L226 Difference]: Without dead ends: 47065 [2018-12-31 22:48:14,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47065 states. [2018-12-31 22:48:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47065 to 31795. [2018-12-31 22:48:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2018-12-31 22:48:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 116818 transitions. [2018-12-31 22:48:15,890 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 116818 transitions. Word has length 46 [2018-12-31 22:48:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:15,892 INFO L480 AbstractCegarLoop]: Abstraction has 31795 states and 116818 transitions. [2018-12-31 22:48:15,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 116818 transitions. [2018-12-31 22:48:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 22:48:15,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:15,900 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 22:48:15,900 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:15,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2058408648, now seen corresponding path program 1 times [2018-12-31 22:48:15,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:15,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:15,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:15,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:15,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:16,157 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 22:48:16,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:16,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:16,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:16,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:16,160 INFO L87 Difference]: Start difference. First operand 31795 states and 116818 transitions. Second operand 5 states. [2018-12-31 22:48:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:17,011 INFO L93 Difference]: Finished difference Result 63027 states and 229113 transitions. [2018-12-31 22:48:17,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:17,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 22:48:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:17,216 INFO L225 Difference]: With dead ends: 63027 [2018-12-31 22:48:17,217 INFO L226 Difference]: Without dead ends: 62563 [2018-12-31 22:48:17,217 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 22:48:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62563 states. [2018-12-31 22:48:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62563 to 35363. [2018-12-31 22:48:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35363 states. [2018-12-31 22:48:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35363 states to 35363 states and 128876 transitions. [2018-12-31 22:48:19,124 INFO L78 Accepts]: Start accepts. Automaton has 35363 states and 128876 transitions. Word has length 47 [2018-12-31 22:48:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:19,124 INFO L480 AbstractCegarLoop]: Abstraction has 35363 states and 128876 transitions. [2018-12-31 22:48:19,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 35363 states and 128876 transitions. [2018-12-31 22:48:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 22:48:19,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:19,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:19,133 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1703022802, now seen corresponding path program 1 times [2018-12-31 22:48:19,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:19,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:19,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:19,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:19,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:19,197 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 22:48:19,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:19,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:48:19,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:48:19,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:48:19,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:19,199 INFO L87 Difference]: Start difference. First operand 35363 states and 128876 transitions. Second operand 3 states. [2018-12-31 22:48:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:19,445 INFO L93 Difference]: Finished difference Result 45909 states and 163944 transitions. [2018-12-31 22:48:19,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:48:19,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 22:48:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:19,590 INFO L225 Difference]: With dead ends: 45909 [2018-12-31 22:48:19,590 INFO L226 Difference]: Without dead ends: 45909 [2018-12-31 22:48:19,591 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 22:48:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45909 states. [2018-12-31 22:48:21,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45909 to 40246. [2018-12-31 22:48:21,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40246 states. [2018-12-31 22:48:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40246 states to 40246 states and 145214 transitions. [2018-12-31 22:48:21,692 INFO L78 Accepts]: Start accepts. Automaton has 40246 states and 145214 transitions. Word has length 49 [2018-12-31 22:48:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:21,693 INFO L480 AbstractCegarLoop]: Abstraction has 40246 states and 145214 transitions. [2018-12-31 22:48:21,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:48:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 40246 states and 145214 transitions. [2018-12-31 22:48:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 22:48:21,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:21,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] [2018-12-31 22:48:21,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:21,710 INFO L82 PathProgramCache]: Analyzing trace with hash 472090535, now seen corresponding path program 1 times [2018-12-31 22:48:21,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:21,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:21,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:21,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:21,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:21,888 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 22:48:21,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:21,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:21,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:21,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:21,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:21,889 INFO L87 Difference]: Start difference. First operand 40246 states and 145214 transitions. Second operand 6 states. [2018-12-31 22:48:23,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:23,023 INFO L93 Difference]: Finished difference Result 70849 states and 252354 transitions. [2018-12-31 22:48:23,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:48:23,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 22:48:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:23,189 INFO L225 Difference]: With dead ends: 70849 [2018-12-31 22:48:23,189 INFO L226 Difference]: Without dead ends: 70313 [2018-12-31 22:48:23,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:48:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70313 states. [2018-12-31 22:48:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70313 to 40897. [2018-12-31 22:48:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40897 states. [2018-12-31 22:48:24,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40897 states to 40897 states and 147667 transitions. [2018-12-31 22:48:24,204 INFO L78 Accepts]: Start accepts. Automaton has 40897 states and 147667 transitions. Word has length 53 [2018-12-31 22:48:24,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:24,204 INFO L480 AbstractCegarLoop]: Abstraction has 40897 states and 147667 transitions. [2018-12-31 22:48:24,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 40897 states and 147667 transitions. [2018-12-31 22:48:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 22:48:24,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:24,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:24,223 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2096426106, now seen corresponding path program 1 times [2018-12-31 22:48:24,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:24,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:24,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:24,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:24,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:24,457 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 22:48:24,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:24,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:24,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:24,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:24,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:24,459 INFO L87 Difference]: Start difference. First operand 40897 states and 147667 transitions. Second operand 6 states. [2018-12-31 22:48:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:28,377 INFO L93 Difference]: Finished difference Result 56598 states and 201647 transitions. [2018-12-31 22:48:28,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:28,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 22:48:28,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:28,512 INFO L225 Difference]: With dead ends: 56598 [2018-12-31 22:48:28,512 INFO L226 Difference]: Without dead ends: 55459 [2018-12-31 22:48:28,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55459 states. [2018-12-31 22:48:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55459 to 51954. [2018-12-31 22:48:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51954 states. [2018-12-31 22:48:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51954 states to 51954 states and 186006 transitions. [2018-12-31 22:48:29,542 INFO L78 Accepts]: Start accepts. Automaton has 51954 states and 186006 transitions. Word has length 53 [2018-12-31 22:48:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:29,542 INFO L480 AbstractCegarLoop]: Abstraction has 51954 states and 186006 transitions. [2018-12-31 22:48:29,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 51954 states and 186006 transitions. [2018-12-31 22:48:29,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 22:48:29,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:29,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:29,563 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash 401589831, now seen corresponding path program 1 times [2018-12-31 22:48:29,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:29,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:29,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:29,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:30,094 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 22:48:30,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:30,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:30,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:30,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:30,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:30,096 INFO L87 Difference]: Start difference. First operand 51954 states and 186006 transitions. Second operand 7 states. [2018-12-31 22:48:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:31,456 INFO L93 Difference]: Finished difference Result 75637 states and 260103 transitions. [2018-12-31 22:48:31,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 22:48:31,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-31 22:48:31,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:31,650 INFO L225 Difference]: With dead ends: 75637 [2018-12-31 22:48:31,650 INFO L226 Difference]: Without dead ends: 75637 [2018-12-31 22:48:31,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:48:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75637 states. [2018-12-31 22:48:33,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75637 to 61472. [2018-12-31 22:48:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61472 states. [2018-12-31 22:48:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61472 states to 61472 states and 215183 transitions. [2018-12-31 22:48:33,742 INFO L78 Accepts]: Start accepts. Automaton has 61472 states and 215183 transitions. Word has length 53 [2018-12-31 22:48:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:33,743 INFO L480 AbstractCegarLoop]: Abstraction has 61472 states and 215183 transitions. [2018-12-31 22:48:33,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 61472 states and 215183 transitions. [2018-12-31 22:48:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 22:48:33,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:33,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:33,761 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:33,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:33,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1289093512, now seen corresponding path program 1 times [2018-12-31 22:48:33,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:33,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:33,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:33,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:33,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:33,948 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 22:48:33,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:33,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:33,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:33,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:33,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:33,949 INFO L87 Difference]: Start difference. First operand 61472 states and 215183 transitions. Second operand 4 states. [2018-12-31 22:48:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:34,023 INFO L93 Difference]: Finished difference Result 13777 states and 43273 transitions. [2018-12-31 22:48:34,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:34,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-31 22:48:34,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:34,051 INFO L225 Difference]: With dead ends: 13777 [2018-12-31 22:48:34,052 INFO L226 Difference]: Without dead ends: 12160 [2018-12-31 22:48:34,052 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 22:48:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2018-12-31 22:48:34,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 12112. [2018-12-31 22:48:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2018-12-31 22:48:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 37957 transitions. [2018-12-31 22:48:34,276 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 37957 transitions. Word has length 53 [2018-12-31 22:48:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:34,276 INFO L480 AbstractCegarLoop]: Abstraction has 12112 states and 37957 transitions. [2018-12-31 22:48:34,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 37957 transitions. [2018-12-31 22:48:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 22:48:34,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:34,284 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] [2018-12-31 22:48:34,284 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:34,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:34,285 INFO L82 PathProgramCache]: Analyzing trace with hash 942323206, now seen corresponding path program 1 times [2018-12-31 22:48:34,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:34,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:34,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:34,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:34,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:34,499 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 22:48:34,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:34,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:34,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:34,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:34,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:34,501 INFO L87 Difference]: Start difference. First operand 12112 states and 37957 transitions. Second operand 4 states. [2018-12-31 22:48:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:35,450 INFO L93 Difference]: Finished difference Result 14275 states and 44580 transitions. [2018-12-31 22:48:35,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:35,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-31 22:48:35,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:35,481 INFO L225 Difference]: With dead ends: 14275 [2018-12-31 22:48:35,481 INFO L226 Difference]: Without dead ends: 14275 [2018-12-31 22:48:35,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 22:48:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2018-12-31 22:48:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 12843. [2018-12-31 22:48:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12843 states. [2018-12-31 22:48:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12843 states to 12843 states and 40182 transitions. [2018-12-31 22:48:35,716 INFO L78 Accepts]: Start accepts. Automaton has 12843 states and 40182 transitions. Word has length 63 [2018-12-31 22:48:35,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:35,716 INFO L480 AbstractCegarLoop]: Abstraction has 12843 states and 40182 transitions. [2018-12-31 22:48:35,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 12843 states and 40182 transitions. [2018-12-31 22:48:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 22:48:35,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:35,725 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] [2018-12-31 22:48:35,725 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:35,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:35,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1609833755, now seen corresponding path program 1 times [2018-12-31 22:48:35,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:35,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:35,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:36,035 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 22:48:36,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:36,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:36,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:36,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:36,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:36,037 INFO L87 Difference]: Start difference. First operand 12843 states and 40182 transitions. Second operand 6 states. [2018-12-31 22:48:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:36,910 INFO L93 Difference]: Finished difference Result 23410 states and 72791 transitions. [2018-12-31 22:48:36,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 22:48:36,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-31 22:48:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:36,954 INFO L225 Difference]: With dead ends: 23410 [2018-12-31 22:48:36,954 INFO L226 Difference]: Without dead ends: 23346 [2018-12-31 22:48:36,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 22:48:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23346 states. [2018-12-31 22:48:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23346 to 13812. [2018-12-31 22:48:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2018-12-31 22:48:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 42966 transitions. [2018-12-31 22:48:37,243 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 42966 transitions. Word has length 63 [2018-12-31 22:48:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:37,244 INFO L480 AbstractCegarLoop]: Abstraction has 13812 states and 42966 transitions. [2018-12-31 22:48:37,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 42966 transitions. [2018-12-31 22:48:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 22:48:37,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:37,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:37,254 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:37,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1160555304, now seen corresponding path program 1 times [2018-12-31 22:48:37,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:37,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:37,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:37,527 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 22:48:37,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:37,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:37,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:37,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:37,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:37,529 INFO L87 Difference]: Start difference. First operand 13812 states and 42966 transitions. Second operand 4 states. [2018-12-31 22:48:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:38,577 INFO L93 Difference]: Finished difference Result 17359 states and 53255 transitions. [2018-12-31 22:48:38,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 22:48:38,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-31 22:48:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:38,607 INFO L225 Difference]: With dead ends: 17359 [2018-12-31 22:48:38,608 INFO L226 Difference]: Without dead ends: 17359 [2018-12-31 22:48:38,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:38,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2018-12-31 22:48:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 15783. [2018-12-31 22:48:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15783 states. [2018-12-31 22:48:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15783 states to 15783 states and 48578 transitions. [2018-12-31 22:48:38,846 INFO L78 Accepts]: Start accepts. Automaton has 15783 states and 48578 transitions. Word has length 65 [2018-12-31 22:48:38,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:38,846 INFO L480 AbstractCegarLoop]: Abstraction has 15783 states and 48578 transitions. [2018-12-31 22:48:38,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 15783 states and 48578 transitions. [2018-12-31 22:48:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 22:48:38,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:38,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:38,859 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:38,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:38,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1057202649, now seen corresponding path program 1 times [2018-12-31 22:48:38,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:38,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:38,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:38,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:38,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:38,978 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 22:48:38,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:38,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 22:48:38,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 22:48:38,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 22:48:38,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 22:48:38,979 INFO L87 Difference]: Start difference. First operand 15783 states and 48578 transitions. Second operand 3 states. [2018-12-31 22:48:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:39,215 INFO L93 Difference]: Finished difference Result 16413 states and 50318 transitions. [2018-12-31 22:48:39,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 22:48:39,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-31 22:48:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:39,248 INFO L225 Difference]: With dead ends: 16413 [2018-12-31 22:48:39,248 INFO L226 Difference]: Without dead ends: 16413 [2018-12-31 22:48:39,249 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 22:48:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16413 states. [2018-12-31 22:48:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16413 to 16125. [2018-12-31 22:48:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2018-12-31 22:48:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 49516 transitions. [2018-12-31 22:48:39,762 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 49516 transitions. Word has length 65 [2018-12-31 22:48:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:39,762 INFO L480 AbstractCegarLoop]: Abstraction has 16125 states and 49516 transitions. [2018-12-31 22:48:39,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 22:48:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 49516 transitions. [2018-12-31 22:48:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:39,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:39,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:39,776 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1484400773, now seen corresponding path program 1 times [2018-12-31 22:48:39,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:39,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:39,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:39,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:39,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:39,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:39,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:39,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:39,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:39,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:39,958 INFO L87 Difference]: Start difference. First operand 16125 states and 49516 transitions. Second operand 6 states. [2018-12-31 22:48:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:40,764 INFO L93 Difference]: Finished difference Result 19568 states and 59304 transitions. [2018-12-31 22:48:40,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:40,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 22:48:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:40,794 INFO L225 Difference]: With dead ends: 19568 [2018-12-31 22:48:40,794 INFO L226 Difference]: Without dead ends: 19568 [2018-12-31 22:48:40,794 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 22:48:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19568 states. [2018-12-31 22:48:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19568 to 18524. [2018-12-31 22:48:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2018-12-31 22:48:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 56466 transitions. [2018-12-31 22:48:41,076 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 56466 transitions. Word has length 67 [2018-12-31 22:48:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:41,077 INFO L480 AbstractCegarLoop]: Abstraction has 18524 states and 56466 transitions. [2018-12-31 22:48:41,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 56466 transitions. [2018-12-31 22:48:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:41,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:41,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:41,095 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:41,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:41,095 INFO L82 PathProgramCache]: Analyzing trace with hash -592808570, now seen corresponding path program 1 times [2018-12-31 22:48:41,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:41,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:41,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:41,495 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 22:48:41,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:41,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:41,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:41,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:41,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:41,497 INFO L87 Difference]: Start difference. First operand 18524 states and 56466 transitions. Second operand 6 states. [2018-12-31 22:48:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:41,995 INFO L93 Difference]: Finished difference Result 21666 states and 64013 transitions. [2018-12-31 22:48:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:48:41,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 22:48:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:42,027 INFO L225 Difference]: With dead ends: 21666 [2018-12-31 22:48:42,027 INFO L226 Difference]: Without dead ends: 21666 [2018-12-31 22:48:42,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 22:48:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21666 states. [2018-12-31 22:48:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21666 to 18841. [2018-12-31 22:48:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18841 states. [2018-12-31 22:48:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18841 states to 18841 states and 56340 transitions. [2018-12-31 22:48:42,305 INFO L78 Accepts]: Start accepts. Automaton has 18841 states and 56340 transitions. Word has length 67 [2018-12-31 22:48:42,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:42,306 INFO L480 AbstractCegarLoop]: Abstraction has 18841 states and 56340 transitions. [2018-12-31 22:48:42,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 18841 states and 56340 transitions. [2018-12-31 22:48:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:42,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:42,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:42,322 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:42,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash -381457657, now seen corresponding path program 1 times [2018-12-31 22:48:42,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:42,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:42,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:42,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:42,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:42,588 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 22:48:42,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:42,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:42,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:42,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:42,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:42,591 INFO L87 Difference]: Start difference. First operand 18841 states and 56340 transitions. Second operand 5 states. [2018-12-31 22:48:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:42,975 INFO L93 Difference]: Finished difference Result 23854 states and 70897 transitions. [2018-12-31 22:48:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:42,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 22:48:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:43,026 INFO L225 Difference]: With dead ends: 23854 [2018-12-31 22:48:43,027 INFO L226 Difference]: Without dead ends: 23854 [2018-12-31 22:48:43,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 22:48:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23854 states. [2018-12-31 22:48:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23854 to 20164. [2018-12-31 22:48:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20164 states. [2018-12-31 22:48:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20164 states to 20164 states and 59821 transitions. [2018-12-31 22:48:43,378 INFO L78 Accepts]: Start accepts. Automaton has 20164 states and 59821 transitions. Word has length 67 [2018-12-31 22:48:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:43,379 INFO L480 AbstractCegarLoop]: Abstraction has 20164 states and 59821 transitions. [2018-12-31 22:48:43,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 20164 states and 59821 transitions. [2018-12-31 22:48:43,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:43,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:43,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:43,395 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:43,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:43,395 INFO L82 PathProgramCache]: Analyzing trace with hash -891991834, now seen corresponding path program 1 times [2018-12-31 22:48:43,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:43,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:43,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:43,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:43,570 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 22:48:43,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:43,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:43,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:43,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:43,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:43,572 INFO L87 Difference]: Start difference. First operand 20164 states and 59821 transitions. Second operand 5 states. [2018-12-31 22:48:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:44,131 INFO L93 Difference]: Finished difference Result 27231 states and 80368 transitions. [2018-12-31 22:48:44,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:44,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 22:48:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:44,185 INFO L225 Difference]: With dead ends: 27231 [2018-12-31 22:48:44,185 INFO L226 Difference]: Without dead ends: 27231 [2018-12-31 22:48:44,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:44,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27231 states. [2018-12-31 22:48:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27231 to 21349. [2018-12-31 22:48:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2018-12-31 22:48:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 63327 transitions. [2018-12-31 22:48:44,596 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 63327 transitions. Word has length 67 [2018-12-31 22:48:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:44,596 INFO L480 AbstractCegarLoop]: Abstraction has 21349 states and 63327 transitions. [2018-12-31 22:48:44,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 63327 transitions. [2018-12-31 22:48:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:44,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:44,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:44,614 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1595520999, now seen corresponding path program 1 times [2018-12-31 22:48:44,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:44,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:44,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:44,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:44,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:44,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:44,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 22:48:44,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 22:48:44,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 22:48:44,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 22:48:44,699 INFO L87 Difference]: Start difference. First operand 21349 states and 63327 transitions. Second operand 4 states. [2018-12-31 22:48:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:45,297 INFO L93 Difference]: Finished difference Result 28445 states and 84501 transitions. [2018-12-31 22:48:45,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 22:48:45,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 22:48:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:45,345 INFO L225 Difference]: With dead ends: 28445 [2018-12-31 22:48:45,346 INFO L226 Difference]: Without dead ends: 28025 [2018-12-31 22:48:45,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28025 states. [2018-12-31 22:48:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28025 to 25833. [2018-12-31 22:48:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25833 states. [2018-12-31 22:48:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25833 states to 25833 states and 76849 transitions. [2018-12-31 22:48:45,747 INFO L78 Accepts]: Start accepts. Automaton has 25833 states and 76849 transitions. Word has length 67 [2018-12-31 22:48:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:45,747 INFO L480 AbstractCegarLoop]: Abstraction has 25833 states and 76849 transitions. [2018-12-31 22:48:45,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 22:48:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 25833 states and 76849 transitions. [2018-12-31 22:48:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 22:48:45,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:45,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 22:48:45,768 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:45,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:45,768 INFO L82 PathProgramCache]: Analyzing trace with hash -201430360, now seen corresponding path program 1 times [2018-12-31 22:48:45,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:45,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:45,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:45,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:45,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:45,869 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 22:48:45,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:45,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:45,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:45,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:45,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:45,870 INFO L87 Difference]: Start difference. First operand 25833 states and 76849 transitions. Second operand 5 states. [2018-12-31 22:48:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:45,920 INFO L93 Difference]: Finished difference Result 7049 states and 16989 transitions. [2018-12-31 22:48:45,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:48:45,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 22:48:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:45,928 INFO L225 Difference]: With dead ends: 7049 [2018-12-31 22:48:45,929 INFO L226 Difference]: Without dead ends: 5562 [2018-12-31 22:48:45,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2018-12-31 22:48:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 4888. [2018-12-31 22:48:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-12-31 22:48:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 11541 transitions. [2018-12-31 22:48:46,132 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 11541 transitions. Word has length 67 [2018-12-31 22:48:46,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:46,132 INFO L480 AbstractCegarLoop]: Abstraction has 4888 states and 11541 transitions. [2018-12-31 22:48:46,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 11541 transitions. [2018-12-31 22:48:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:48:46,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:46,139 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] [2018-12-31 22:48:46,139 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:46,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:46,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1632761670, now seen corresponding path program 1 times [2018-12-31 22:48:46,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:46,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:46,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:46,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:46,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:46,420 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 22:48:46,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:46,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 22:48:46,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 22:48:46,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 22:48:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 22:48:46,421 INFO L87 Difference]: Start difference. First operand 4888 states and 11541 transitions. Second operand 5 states. [2018-12-31 22:48:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:46,698 INFO L93 Difference]: Finished difference Result 5732 states and 13375 transitions. [2018-12-31 22:48:46,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:46,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-31 22:48:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:46,708 INFO L225 Difference]: With dead ends: 5732 [2018-12-31 22:48:46,708 INFO L226 Difference]: Without dead ends: 5698 [2018-12-31 22:48:46,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2018-12-31 22:48:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5046. [2018-12-31 22:48:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5046 states. [2018-12-31 22:48:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 11853 transitions. [2018-12-31 22:48:46,765 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 11853 transitions. Word has length 82 [2018-12-31 22:48:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:46,766 INFO L480 AbstractCegarLoop]: Abstraction has 5046 states and 11853 transitions. [2018-12-31 22:48:46,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 22:48:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 11853 transitions. [2018-12-31 22:48:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:48:46,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48: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] [2018-12-31 22:48:46,772 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:46,772 INFO L82 PathProgramCache]: Analyzing trace with hash -35293979, now seen corresponding path program 1 times [2018-12-31 22:48:46,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:46,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:46,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:47,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:47,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:47,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:47,018 INFO L87 Difference]: Start difference. First operand 5046 states and 11853 transitions. Second operand 6 states. [2018-12-31 22:48:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:47,343 INFO L93 Difference]: Finished difference Result 6708 states and 15748 transitions. [2018-12-31 22:48:47,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:47,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-31 22:48:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:47,353 INFO L225 Difference]: With dead ends: 6708 [2018-12-31 22:48:47,353 INFO L226 Difference]: Without dead ends: 6676 [2018-12-31 22:48:47,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 22:48:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6676 states. [2018-12-31 22:48:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6676 to 5404. [2018-12-31 22:48:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5404 states. [2018-12-31 22:48:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 12732 transitions. [2018-12-31 22:48:47,416 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 12732 transitions. Word has length 82 [2018-12-31 22:48:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:47,417 INFO L480 AbstractCegarLoop]: Abstraction has 5404 states and 12732 transitions. [2018-12-31 22:48:47,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 12732 transitions. [2018-12-31 22:48:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:48:47,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:47,423 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] [2018-12-31 22:48:47,423 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:47,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:47,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1832245338, now seen corresponding path program 1 times [2018-12-31 22:48:47,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:47,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:47,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:47,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:47,732 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 22:48:47,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:47,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:47,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:47,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:47,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:47,733 INFO L87 Difference]: Start difference. First operand 5404 states and 12732 transitions. Second operand 7 states. [2018-12-31 22:48:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:48,213 INFO L93 Difference]: Finished difference Result 8734 states and 21012 transitions. [2018-12-31 22:48:48,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 22:48:48,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-31 22:48:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:48,226 INFO L225 Difference]: With dead ends: 8734 [2018-12-31 22:48:48,226 INFO L226 Difference]: Without dead ends: 8734 [2018-12-31 22:48:48,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:48:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8734 states. [2018-12-31 22:48:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8734 to 6145. [2018-12-31 22:48:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6145 states. [2018-12-31 22:48:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 14616 transitions. [2018-12-31 22:48:48,315 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 14616 transitions. Word has length 82 [2018-12-31 22:48:48,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:48,315 INFO L480 AbstractCegarLoop]: Abstraction has 6145 states and 14616 transitions. [2018-12-31 22:48:48,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 14616 transitions. [2018-12-31 22:48:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:48:48,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:48,323 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] [2018-12-31 22:48:48,323 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:48,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:48,323 INFO L82 PathProgramCache]: Analyzing trace with hash -944741657, now seen corresponding path program 1 times [2018-12-31 22:48:48,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:48,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:48,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:48,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:48,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:48,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:48,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:48,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:48,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:48,431 INFO L87 Difference]: Start difference. First operand 6145 states and 14616 transitions. Second operand 6 states. [2018-12-31 22:48:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:48,919 INFO L93 Difference]: Finished difference Result 7685 states and 18102 transitions. [2018-12-31 22:48:48,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 22:48:48,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-31 22:48:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:48,932 INFO L225 Difference]: With dead ends: 7685 [2018-12-31 22:48:48,932 INFO L226 Difference]: Without dead ends: 7685 [2018-12-31 22:48:48,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7685 states. [2018-12-31 22:48:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7685 to 5994. [2018-12-31 22:48:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2018-12-31 22:48:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 14208 transitions. [2018-12-31 22:48:49,037 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 14208 transitions. Word has length 82 [2018-12-31 22:48:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:49,037 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 14208 transitions. [2018-12-31 22:48:49,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 14208 transitions. [2018-12-31 22:48:49,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-31 22:48:49,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:49,047 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] [2018-12-31 22:48:49,049 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:49,049 INFO L82 PathProgramCache]: Analyzing trace with hash 385512615, now seen corresponding path program 1 times [2018-12-31 22:48:49,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:49,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:49,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:49,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:49,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:49,473 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 22:48:49,870 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-12-31 22:48:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 22:48:49,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:49,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 22:48:49,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 22:48:49,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 22:48:49,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 22:48:49,883 INFO L87 Difference]: Start difference. First operand 5994 states and 14208 transitions. Second operand 6 states. [2018-12-31 22:48:50,202 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 22:48:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:51,202 INFO L93 Difference]: Finished difference Result 5546 states and 12816 transitions. [2018-12-31 22:48:51,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:51,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-31 22:48:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:51,210 INFO L225 Difference]: With dead ends: 5546 [2018-12-31 22:48:51,210 INFO L226 Difference]: Without dead ends: 5546 [2018-12-31 22:48:51,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5546 states. [2018-12-31 22:48:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5546 to 3311. [2018-12-31 22:48:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2018-12-31 22:48:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 7698 transitions. [2018-12-31 22:48:51,262 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 7698 transitions. Word has length 82 [2018-12-31 22:48:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:51,263 INFO L480 AbstractCegarLoop]: Abstraction has 3311 states and 7698 transitions. [2018-12-31 22:48:51,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 22:48:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 7698 transitions. [2018-12-31 22:48:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:51,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:51,267 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] [2018-12-31 22:48:51,267 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:51,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash 947808699, now seen corresponding path program 1 times [2018-12-31 22:48:51,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:51,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:51,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:51,566 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 22:48:51,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:51,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:51,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:51,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:51,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:51,567 INFO L87 Difference]: Start difference. First operand 3311 states and 7698 transitions. Second operand 7 states. [2018-12-31 22:48:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:51,891 INFO L93 Difference]: Finished difference Result 3859 states and 8934 transitions. [2018-12-31 22:48:51,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:48:51,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-31 22:48:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:51,897 INFO L225 Difference]: With dead ends: 3859 [2018-12-31 22:48:51,897 INFO L226 Difference]: Without dead ends: 3859 [2018-12-31 22:48:51,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:48:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3859 states. [2018-12-31 22:48:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3859 to 3762. [2018-12-31 22:48:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3762 states. [2018-12-31 22:48:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3762 states to 3762 states and 8742 transitions. [2018-12-31 22:48:51,935 INFO L78 Accepts]: Start accepts. Automaton has 3762 states and 8742 transitions. Word has length 84 [2018-12-31 22:48:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:51,936 INFO L480 AbstractCegarLoop]: Abstraction has 3762 states and 8742 transitions. [2018-12-31 22:48:51,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3762 states and 8742 transitions. [2018-12-31 22:48:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:51,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:51,940 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] [2018-12-31 22:48:51,940 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:51,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:51,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1835312380, now seen corresponding path program 1 times [2018-12-31 22:48:51,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:51,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:51,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:51,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:51,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:52,253 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 22:48:52,425 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 22:48:53,396 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 22:48:53,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:53,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 22:48:53,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 22:48:53,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 22:48:53,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:48:53,398 INFO L87 Difference]: Start difference. First operand 3762 states and 8742 transitions. Second operand 10 states. [2018-12-31 22:48:53,870 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-31 22:48:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:55,284 INFO L93 Difference]: Finished difference Result 6571 states and 15277 transitions. [2018-12-31 22:48:55,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:48:55,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-12-31 22:48:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:55,292 INFO L225 Difference]: With dead ends: 6571 [2018-12-31 22:48:55,292 INFO L226 Difference]: Without dead ends: 4418 [2018-12-31 22:48:55,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-31 22:48:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states. [2018-12-31 22:48:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 3797. [2018-12-31 22:48:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2018-12-31 22:48:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 8741 transitions. [2018-12-31 22:48:55,337 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 8741 transitions. Word has length 84 [2018-12-31 22:48:55,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:55,337 INFO L480 AbstractCegarLoop]: Abstraction has 3797 states and 8741 transitions. [2018-12-31 22:48:55,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 22:48:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 8741 transitions. [2018-12-31 22:48:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:55,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:55,342 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] [2018-12-31 22:48:55,343 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1827356332, now seen corresponding path program 2 times [2018-12-31 22:48:55,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:55,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:55,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:55,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:55,642 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 22:48:55,813 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-31 22:48:56,132 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 22:48:56,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:56,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 22:48:56,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 22:48:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 22:48:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 22:48:56,133 INFO L87 Difference]: Start difference. First operand 3797 states and 8741 transitions. Second operand 8 states. [2018-12-31 22:48:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:56,889 INFO L93 Difference]: Finished difference Result 6763 states and 15653 transitions. [2018-12-31 22:48:56,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 22:48:56,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-31 22:48:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:56,896 INFO L225 Difference]: With dead ends: 6763 [2018-12-31 22:48:56,896 INFO L226 Difference]: Without dead ends: 2923 [2018-12-31 22:48:56,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-31 22:48:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2018-12-31 22:48:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2923. [2018-12-31 22:48:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2018-12-31 22:48:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 6793 transitions. [2018-12-31 22:48:56,926 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 6793 transitions. Word has length 84 [2018-12-31 22:48:56,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:56,926 INFO L480 AbstractCegarLoop]: Abstraction has 2923 states and 6793 transitions. [2018-12-31 22:48:56,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 22:48:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 6793 transitions. [2018-12-31 22:48:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:56,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:56,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] [2018-12-31 22:48:56,934 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:56,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:56,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1117969270, now seen corresponding path program 1 times [2018-12-31 22:48:56,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:56,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:56,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:56,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:48:56,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:57,410 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 22:48:57,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:57,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:57,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:57,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:57,411 INFO L87 Difference]: Start difference. First operand 2923 states and 6793 transitions. Second operand 7 states. [2018-12-31 22:48:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:57,749 INFO L93 Difference]: Finished difference Result 3366 states and 7840 transitions. [2018-12-31 22:48:57,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 22:48:57,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-31 22:48:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:57,755 INFO L225 Difference]: With dead ends: 3366 [2018-12-31 22:48:57,755 INFO L226 Difference]: Without dead ends: 3366 [2018-12-31 22:48:57,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3366 states. [2018-12-31 22:48:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3366 to 3001. [2018-12-31 22:48:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3001 states. [2018-12-31 22:48:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 7012 transitions. [2018-12-31 22:48:57,788 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 7012 transitions. Word has length 84 [2018-12-31 22:48:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:57,788 INFO L480 AbstractCegarLoop]: Abstraction has 3001 states and 7012 transitions. [2018-12-31 22:48:57,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 7012 transitions. [2018-12-31 22:48:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:57,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:57,792 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] [2018-12-31 22:48:57,792 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:57,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:57,793 INFO L82 PathProgramCache]: Analyzing trace with hash 649061720, now seen corresponding path program 1 times [2018-12-31 22:48:57,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:57,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:57,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:57,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:57,992 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 22:48:57,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:57,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 22:48:57,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 22:48:57,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 22:48:57,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 22:48:57,993 INFO L87 Difference]: Start difference. First operand 3001 states and 7012 transitions. Second operand 7 states. [2018-12-31 22:48:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:58,266 INFO L93 Difference]: Finished difference Result 3117 states and 7205 transitions. [2018-12-31 22:48:58,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 22:48:58,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-31 22:48:58,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:58,271 INFO L225 Difference]: With dead ends: 3117 [2018-12-31 22:48:58,272 INFO L226 Difference]: Without dead ends: 3117 [2018-12-31 22:48:58,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-31 22:48:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2018-12-31 22:48:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 2849. [2018-12-31 22:48:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2849 states. [2018-12-31 22:48:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 6592 transitions. [2018-12-31 22:48:58,305 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 6592 transitions. Word has length 84 [2018-12-31 22:48:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:58,305 INFO L480 AbstractCegarLoop]: Abstraction has 2849 states and 6592 transitions. [2018-12-31 22:48:58,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 22:48:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 6592 transitions. [2018-12-31 22:48:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:58,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:58,311 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] [2018-12-31 22:48:58,312 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:58,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:58,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1610675737, now seen corresponding path program 2 times [2018-12-31 22:48:58,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:58,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:58,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:58,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 22:48:58,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:58,583 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 22:48:58,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:58,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 22:48:58,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 22:48:58,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 22:48:58,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:48:58,584 INFO L87 Difference]: Start difference. First operand 2849 states and 6592 transitions. Second operand 11 states. [2018-12-31 22:48:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:48:59,476 INFO L93 Difference]: Finished difference Result 4062 states and 9371 transitions. [2018-12-31 22:48:59,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:48:59,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-12-31 22:48:59,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:48:59,482 INFO L225 Difference]: With dead ends: 4062 [2018-12-31 22:48:59,482 INFO L226 Difference]: Without dead ends: 4062 [2018-12-31 22:48:59,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-12-31 22:48:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2018-12-31 22:48:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 2862. [2018-12-31 22:48:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2862 states. [2018-12-31 22:48:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 6613 transitions. [2018-12-31 22:48:59,519 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 6613 transitions. Word has length 84 [2018-12-31 22:48:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:48:59,520 INFO L480 AbstractCegarLoop]: Abstraction has 2862 states and 6613 transitions. [2018-12-31 22:48:59,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 22:48:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 6613 transitions. [2018-12-31 22:48:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:48:59,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:48:59,524 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] [2018-12-31 22:48:59,524 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:48:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:48:59,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1796787878, now seen corresponding path program 3 times [2018-12-31 22:48:59,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:48:59,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:48:59,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:59,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:48:59,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:48:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 22:48:59,770 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 22:48:59,848 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 22:48:59,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 22:48:59,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 22:48:59,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 22:48:59,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 22:48:59,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 22:48:59,849 INFO L87 Difference]: Start difference. First operand 2862 states and 6613 transitions. Second operand 11 states. [2018-12-31 22:49:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 22:49:00,869 INFO L93 Difference]: Finished difference Result 4969 states and 11536 transitions. [2018-12-31 22:49:00,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 22:49:00,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-12-31 22:49:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 22:49:00,875 INFO L225 Difference]: With dead ends: 4969 [2018-12-31 22:49:00,875 INFO L226 Difference]: Without dead ends: 3170 [2018-12-31 22:49:00,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-31 22:49:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-12-31 22:49:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 2842. [2018-12-31 22:49:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2842 states. [2018-12-31 22:49:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2842 states and 6571 transitions. [2018-12-31 22:49:00,910 INFO L78 Accepts]: Start accepts. Automaton has 2842 states and 6571 transitions. Word has length 84 [2018-12-31 22:49:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 22:49:00,910 INFO L480 AbstractCegarLoop]: Abstraction has 2842 states and 6571 transitions. [2018-12-31 22:49:00,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 22:49:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 6571 transitions. [2018-12-31 22:49:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-31 22:49:00,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 22:49:00,914 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] [2018-12-31 22:49:00,915 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 22:49:00,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 22:49:00,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1396979846, now seen corresponding path program 4 times [2018-12-31 22:49:00,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 22:49:00,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 22:49:00,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:00,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 22:49:00,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 22:49:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:49:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 22:49:00,992 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 22:49:01,177 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 22:49:01,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:49:01 BasicIcfg [2018-12-31 22:49:01,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 22:49:01,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 22:49:01,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 22:49:01,188 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 22:49:01,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:48:04" (3/4) ... [2018-12-31 22:49:01,194 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 22:49:01,361 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 22:49:01,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 22:49:01,362 INFO L168 Benchmark]: Toolchain (without parser) took 59336.85 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 946.0 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-31 22:49:01,364 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 22:49:01,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 980.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-31 22:49:01,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 22:49:01,366 INFO L168 Benchmark]: Boogie Preprocessor took 75.12 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 22:49:01,368 INFO L168 Benchmark]: RCFGBuilder took 1140.71 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: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-12-31 22:49:01,369 INFO L168 Benchmark]: TraceAbstraction took 56855.98 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-31 22:49:01,369 INFO L168 Benchmark]: Witness Printer took 174.04 ms. Allocated memory is still 4.5 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-31 22:49:01,373 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 980.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.12 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 1140.71 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: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56855.98 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 174.04 ms. Allocated memory is still 4.5 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -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] [L680] -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] [L682] -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 _Bool x$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, x$flush_delayed=0] [L684] -1 int x$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, x$flush_delayed=0, x$mem_tmp=0] [L685] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L686] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L687] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L688] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L689] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L690] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L691] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L692] -1 int *x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L693] -1 int x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L694] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L695] -1 int x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L696] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L698] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L700] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] -1 pthread_t t1639; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] FCALL, FORK -1 pthread_create(&t1639, ((void *)0), P0, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] -1 pthread_t t1640; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK -1 pthread_create(&t1640, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 x$w_buff1 = x$w_buff0 [L735] 0 x$w_buff0 = 1 [L736] 0 x$w_buff1_used = x$w_buff0_used [L737] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L740] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L741] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L742] 0 x$r_buff0_thd2 = (_Bool)1 [L745] 0 y = 1 [L748] 0 __unbuffered_p1_EAX = y [L751] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L704] 1 y = 2 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 x$flush_delayed = weak$$choice2 [L712] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L755] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L713] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L715] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L716] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] 1 x = x$flush_delayed ? x$mem_tmp : x [L722] 1 x$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 3 error locations. UNSAFE Result, 56.6s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 28.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8095 SDtfs, 9762 SDslu, 19902 SDs, 0 SdLazy, 8746 SolverSat, 408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 77 SyntacticMatches, 24 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61472occurred in iteration=7, 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.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 148574 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 2132 NumberOfCodeBlocks, 2132 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2018 ConstructedInterpolants, 0 QuantifiedInterpolants, 369330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...