/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:58:31,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:58:31,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:58:31,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:58:31,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:58:31,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:58:31,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:58:31,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:58:31,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:58:31,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:58:31,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:58:31,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:58:31,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:58:31,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:58:31,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:58:31,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:58:31,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:58:31,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:58:31,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:58:31,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:58:31,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:58:32,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:58:32,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:58:32,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:58:32,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:58:32,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:58:32,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:58:32,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:58:32,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:58:32,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:58:32,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:58:32,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:58:32,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:58:32,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:58:32,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:58:32,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:58:32,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:58:32,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:58:32,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:58:32,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:58:32,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:58:32,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 03:58:32,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:58:32,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:58:32,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:58:32,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:58:32,052 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:58:32,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:58:32,053 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:58:32,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:58:32,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:58:32,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:58:32,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:58:32,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:58:32,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:58:32,054 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:58:32,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:58:32,054 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:58:32,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:58:32,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:58:32,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:58:32,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:58:32,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:58:32,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:58:32,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:58:32,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:58:32,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:58:32,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:58:32,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:58:32,057 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:58:32,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:58:32,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:58:32,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:58:32,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:58:32,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:58:32,353 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:58:32,353 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:58:32,354 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i [2019-12-19 03:58:32,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029dddc31/39cfd99c4b564c61af4a924e9db8b17c/FLAG423b8ea63 [2019-12-19 03:58:33,010 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:58:33,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_power.opt.i [2019-12-19 03:58:33,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029dddc31/39cfd99c4b564c61af4a924e9db8b17c/FLAG423b8ea63 [2019-12-19 03:58:33,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029dddc31/39cfd99c4b564c61af4a924e9db8b17c [2019-12-19 03:58:33,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:58:33,294 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:58:33,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:58:33,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:58:33,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:58:33,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:58:33" (1/1) ... [2019-12-19 03:58:33,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:33, skipping insertion in model container [2019-12-19 03:58:33,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:58:33" (1/1) ... [2019-12-19 03:58:33,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:58:33,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:58:33,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:58:33,960 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:58:34,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:58:34,111 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:58:34,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34 WrapperNode [2019-12-19 03:58:34,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:58:34,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:58:34,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:58:34,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:58:34,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34" (1/1) ... [2019-12-19 03:58:34,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34" (1/1) ... [2019-12-19 03:58:34,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:58:34,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:58:34,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:58:34,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:58:34,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34" (1/1) ... [2019-12-19 03:58:34,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34" (1/1) ... [2019-12-19 03:58:34,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34" (1/1) ... [2019-12-19 03:58:34,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34" (1/1) ... [2019-12-19 03:58:34,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34" (1/1) ... [2019-12-19 03:58:34,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34" (1/1) ... [2019-12-19 03:58:34,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34" (1/1) ... [2019-12-19 03:58:34,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:58:34,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:58:34,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:58:34,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:58:34,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:58:34,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:58:34,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:58:34,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:58:34,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:58:34,304 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:58:34,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:58:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:58:34,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:58:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:58:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:58:34,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:58:34,307 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 03:58:35,127 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:58:35,128 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:58:35,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:58:35 BoogieIcfgContainer [2019-12-19 03:58:35,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:58:35,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:58:35,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:58:35,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:58:35,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:58:33" (1/3) ... [2019-12-19 03:58:35,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4657de4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:58:35, skipping insertion in model container [2019-12-19 03:58:35,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:58:34" (2/3) ... [2019-12-19 03:58:35,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4657de4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:58:35, skipping insertion in model container [2019-12-19 03:58:35,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:58:35" (3/3) ... [2019-12-19 03:58:35,139 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.opt.i [2019-12-19 03:58:35,149 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:58:35,150 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:58:35,158 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:58:35,159 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:58:35,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,224 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,224 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,285 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,293 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,294 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,296 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:58:35,313 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:58:35,333 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:58:35,333 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:58:35,334 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:58:35,334 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:58:35,334 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:58:35,334 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:58:35,334 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:58:35,334 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:58:35,349 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 179 places, 228 transitions [2019-12-19 03:58:44,147 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80073 states. [2019-12-19 03:58:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 80073 states. [2019-12-19 03:58:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-19 03:58:44,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:58:44,159 INFO L411 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] [2019-12-19 03:58:44,159 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:58:44,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:58:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash -603534954, now seen corresponding path program 1 times [2019-12-19 03:58:44,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:58:44,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704175243] [2019-12-19 03:58:44,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:58:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:58:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:58:44,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704175243] [2019-12-19 03:58:44,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:58:44,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:58:44,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939776123] [2019-12-19 03:58:44,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:58:44,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:58:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:58:44,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:58:44,517 INFO L87 Difference]: Start difference. First operand 80073 states. Second operand 4 states. [2019-12-19 03:58:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:58:45,593 INFO L93 Difference]: Finished difference Result 80713 states and 324638 transitions. [2019-12-19 03:58:45,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:58:45,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-19 03:58:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:58:47,906 INFO L225 Difference]: With dead ends: 80713 [2019-12-19 03:58:47,906 INFO L226 Difference]: Without dead ends: 59001 [2019-12-19 03:58:47,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:58:49,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59001 states. [2019-12-19 03:58:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59001 to 59001. [2019-12-19 03:58:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59001 states. [2019-12-19 03:58:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59001 states to 59001 states and 240126 transitions. [2019-12-19 03:58:51,464 INFO L78 Accepts]: Start accepts. Automaton has 59001 states and 240126 transitions. Word has length 40 [2019-12-19 03:58:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:58:51,464 INFO L462 AbstractCegarLoop]: Abstraction has 59001 states and 240126 transitions. [2019-12-19 03:58:51,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:58:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 59001 states and 240126 transitions. [2019-12-19 03:58:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 03:58:51,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:58:51,479 INFO L411 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] [2019-12-19 03:58:51,479 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:58:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:58:51,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1788922938, now seen corresponding path program 1 times [2019-12-19 03:58:51,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:58:51,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463685975] [2019-12-19 03:58:51,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:58:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:58:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:58:51,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463685975] [2019-12-19 03:58:51,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:58:51,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:58:51,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803139848] [2019-12-19 03:58:51,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:58:51,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:58:51,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:58:51,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:58:51,635 INFO L87 Difference]: Start difference. First operand 59001 states and 240126 transitions. Second operand 5 states. [2019-12-19 03:58:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:58:55,560 INFO L93 Difference]: Finished difference Result 95595 states and 363717 transitions. [2019-12-19 03:58:55,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:58:55,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 03:58:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:58:55,954 INFO L225 Difference]: With dead ends: 95595 [2019-12-19 03:58:55,954 INFO L226 Difference]: Without dead ends: 95043 [2019-12-19 03:58:55,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:58:57,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95043 states. [2019-12-19 03:58:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95043 to 93165. [2019-12-19 03:58:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93165 states. [2019-12-19 03:58:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93165 states to 93165 states and 356303 transitions. [2019-12-19 03:58:59,603 INFO L78 Accepts]: Start accepts. Automaton has 93165 states and 356303 transitions. Word has length 48 [2019-12-19 03:58:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:58:59,605 INFO L462 AbstractCegarLoop]: Abstraction has 93165 states and 356303 transitions. [2019-12-19 03:58:59,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:58:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 93165 states and 356303 transitions. [2019-12-19 03:58:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 03:58:59,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:58:59,612 INFO L411 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] [2019-12-19 03:58:59,613 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:58:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:58:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash -746061459, now seen corresponding path program 1 times [2019-12-19 03:58:59,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:58:59,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576735183] [2019-12-19 03:58:59,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:58:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:58:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:58:59,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576735183] [2019-12-19 03:58:59,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:58:59,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:58:59,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14972060] [2019-12-19 03:58:59,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:58:59,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:58:59,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:58:59,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:58:59,698 INFO L87 Difference]: Start difference. First operand 93165 states and 356303 transitions. Second operand 5 states. [2019-12-19 03:59:03,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:03,316 INFO L93 Difference]: Finished difference Result 118509 states and 442884 transitions. [2019-12-19 03:59:03,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:59:03,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 03:59:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:03,641 INFO L225 Difference]: With dead ends: 118509 [2019-12-19 03:59:03,641 INFO L226 Difference]: Without dead ends: 118061 [2019-12-19 03:59:03,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:59:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118061 states. [2019-12-19 03:59:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118061 to 104154. [2019-12-19 03:59:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104154 states. [2019-12-19 03:59:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104154 states to 104154 states and 394237 transitions. [2019-12-19 03:59:07,821 INFO L78 Accepts]: Start accepts. Automaton has 104154 states and 394237 transitions. Word has length 49 [2019-12-19 03:59:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:07,822 INFO L462 AbstractCegarLoop]: Abstraction has 104154 states and 394237 transitions. [2019-12-19 03:59:07,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:59:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 104154 states and 394237 transitions. [2019-12-19 03:59:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 03:59:07,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:07,832 INFO L411 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] [2019-12-19 03:59:07,833 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:07,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:07,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1178009107, now seen corresponding path program 1 times [2019-12-19 03:59:07,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:07,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026652132] [2019-12-19 03:59:07,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:59:07,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026652132] [2019-12-19 03:59:07,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:07,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:59:07,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529059926] [2019-12-19 03:59:07,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:59:07,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:07,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:59:07,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:59:07,897 INFO L87 Difference]: Start difference. First operand 104154 states and 394237 transitions. Second operand 3 states. [2019-12-19 03:59:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:12,872 INFO L93 Difference]: Finished difference Result 170912 states and 627059 transitions. [2019-12-19 03:59:12,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:59:12,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-19 03:59:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:13,331 INFO L225 Difference]: With dead ends: 170912 [2019-12-19 03:59:13,331 INFO L226 Difference]: Without dead ends: 170912 [2019-12-19 03:59:13,331 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 [2019-12-19 03:59:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170912 states. [2019-12-19 03:59:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170912 to 157190. [2019-12-19 03:59:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157190 states. [2019-12-19 03:59:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157190 states to 157190 states and 581291 transitions. [2019-12-19 03:59:18,907 INFO L78 Accepts]: Start accepts. Automaton has 157190 states and 581291 transitions. Word has length 51 [2019-12-19 03:59:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:18,907 INFO L462 AbstractCegarLoop]: Abstraction has 157190 states and 581291 transitions. [2019-12-19 03:59:18,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:59:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 157190 states and 581291 transitions. [2019-12-19 03:59:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:59:18,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:18,933 INFO L411 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] [2019-12-19 03:59:18,933 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:18,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:18,934 INFO L82 PathProgramCache]: Analyzing trace with hash 105108318, now seen corresponding path program 1 times [2019-12-19 03:59:18,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:18,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896796034] [2019-12-19 03:59:18,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:59:19,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896796034] [2019-12-19 03:59:19,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:19,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:59:19,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371326248] [2019-12-19 03:59:19,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:59:19,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:19,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:59:19,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:59:19,034 INFO L87 Difference]: Start difference. First operand 157190 states and 581291 transitions. Second operand 6 states. [2019-12-19 03:59:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:26,460 INFO L93 Difference]: Finished difference Result 212574 states and 766173 transitions. [2019-12-19 03:59:26,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:59:26,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 03:59:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:27,070 INFO L225 Difference]: With dead ends: 212574 [2019-12-19 03:59:27,070 INFO L226 Difference]: Without dead ends: 212054 [2019-12-19 03:59:27,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 03:59:29,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212054 states. [2019-12-19 03:59:31,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212054 to 157972. [2019-12-19 03:59:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157972 states. [2019-12-19 03:59:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157972 states to 157972 states and 584228 transitions. [2019-12-19 03:59:32,513 INFO L78 Accepts]: Start accepts. Automaton has 157972 states and 584228 transitions. Word has length 55 [2019-12-19 03:59:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:32,513 INFO L462 AbstractCegarLoop]: Abstraction has 157972 states and 584228 transitions. [2019-12-19 03:59:32,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:59:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 157972 states and 584228 transitions. [2019-12-19 03:59:32,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:59:32,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:32,534 INFO L411 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] [2019-12-19 03:59:32,534 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:32,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:32,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2117067120, now seen corresponding path program 1 times [2019-12-19 03:59:32,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:32,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767948214] [2019-12-19 03:59:32,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:59:32,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767948214] [2019-12-19 03:59:32,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:32,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:59:32,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692707292] [2019-12-19 03:59:32,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:59:32,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:32,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:59:32,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:59:32,650 INFO L87 Difference]: Start difference. First operand 157972 states and 584228 transitions. Second operand 6 states. [2019-12-19 03:59:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:39,926 INFO L93 Difference]: Finished difference Result 208199 states and 766452 transitions. [2019-12-19 03:59:39,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:59:39,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 03:59:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:40,571 INFO L225 Difference]: With dead ends: 208199 [2019-12-19 03:59:40,572 INFO L226 Difference]: Without dead ends: 208199 [2019-12-19 03:59:40,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:59:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208199 states. [2019-12-19 03:59:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208199 to 193995. [2019-12-19 03:59:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193995 states. [2019-12-19 03:59:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193995 states to 193995 states and 714236 transitions. [2019-12-19 03:59:47,486 INFO L78 Accepts]: Start accepts. Automaton has 193995 states and 714236 transitions. Word has length 55 [2019-12-19 03:59:47,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:59:47,487 INFO L462 AbstractCegarLoop]: Abstraction has 193995 states and 714236 transitions. [2019-12-19 03:59:47,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:59:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 193995 states and 714236 transitions. [2019-12-19 03:59:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:59:47,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:59:47,513 INFO L411 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] [2019-12-19 03:59:47,513 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:59:47,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:59:47,514 INFO L82 PathProgramCache]: Analyzing trace with hash 380948817, now seen corresponding path program 1 times [2019-12-19 03:59:47,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:59:47,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066651907] [2019-12-19 03:59:47,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:59:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:59:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:59:47,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066651907] [2019-12-19 03:59:47,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:59:47,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:59:47,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145671978] [2019-12-19 03:59:47,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:59:47,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:59:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:59:47,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:59:47,606 INFO L87 Difference]: Start difference. First operand 193995 states and 714236 transitions. Second operand 7 states. [2019-12-19 03:59:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:59:49,876 INFO L93 Difference]: Finished difference Result 277138 states and 986576 transitions. [2019-12-19 03:59:49,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:59:49,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-19 03:59:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:59:52,150 INFO L225 Difference]: With dead ends: 277138 [2019-12-19 03:59:52,150 INFO L226 Difference]: Without dead ends: 277138 [2019-12-19 03:59:52,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:59:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277138 states. [2019-12-19 04:00:05,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277138 to 222094. [2019-12-19 04:00:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222094 states. [2019-12-19 04:00:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222094 states to 222094 states and 805380 transitions. [2019-12-19 04:00:06,790 INFO L78 Accepts]: Start accepts. Automaton has 222094 states and 805380 transitions. Word has length 55 [2019-12-19 04:00:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:06,791 INFO L462 AbstractCegarLoop]: Abstraction has 222094 states and 805380 transitions. [2019-12-19 04:00:06,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 222094 states and 805380 transitions. [2019-12-19 04:00:06,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 04:00:06,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:06,815 INFO L411 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] [2019-12-19 04:00:06,815 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:06,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:06,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1268452498, now seen corresponding path program 1 times [2019-12-19 04:00:06,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:06,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480815759] [2019-12-19 04:00:06,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:06,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480815759] [2019-12-19 04:00:06,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:06,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:00:06,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933065857] [2019-12-19 04:00:06,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:00:06,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:06,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:00:06,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:00:06,914 INFO L87 Difference]: Start difference. First operand 222094 states and 805380 transitions. Second operand 3 states. [2019-12-19 04:00:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:07,745 INFO L93 Difference]: Finished difference Result 176990 states and 632038 transitions. [2019-12-19 04:00:07,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:00:07,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-19 04:00:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:08,167 INFO L225 Difference]: With dead ends: 176990 [2019-12-19 04:00:08,167 INFO L226 Difference]: Without dead ends: 176990 [2019-12-19 04:00:08,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:00:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176990 states. [2019-12-19 04:00:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176990 to 172178. [2019-12-19 04:00:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172178 states. [2019-12-19 04:00:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172178 states to 172178 states and 617063 transitions. [2019-12-19 04:00:19,303 INFO L78 Accepts]: Start accepts. Automaton has 172178 states and 617063 transitions. Word has length 55 [2019-12-19 04:00:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:19,304 INFO L462 AbstractCegarLoop]: Abstraction has 172178 states and 617063 transitions. [2019-12-19 04:00:19,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:00:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 172178 states and 617063 transitions. [2019-12-19 04:00:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 04:00:19,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:19,325 INFO L411 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] [2019-12-19 04:00:19,325 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:19,325 INFO L82 PathProgramCache]: Analyzing trace with hash 885774422, now seen corresponding path program 1 times [2019-12-19 04:00:19,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:19,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236013079] [2019-12-19 04:00:19,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:19,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236013079] [2019-12-19 04:00:19,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:19,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:00:19,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400716976] [2019-12-19 04:00:19,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:00:19,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:19,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:00:19,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:00:19,444 INFO L87 Difference]: Start difference. First operand 172178 states and 617063 transitions. Second operand 6 states. [2019-12-19 04:00:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:22,098 INFO L93 Difference]: Finished difference Result 216117 states and 757196 transitions. [2019-12-19 04:00:22,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:00:22,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-19 04:00:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:22,638 INFO L225 Difference]: With dead ends: 216117 [2019-12-19 04:00:22,638 INFO L226 Difference]: Without dead ends: 216117 [2019-12-19 04:00:22,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216117 states. [2019-12-19 04:00:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216117 to 185518. [2019-12-19 04:00:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185518 states. [2019-12-19 04:00:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185518 states to 185518 states and 660438 transitions. [2019-12-19 04:00:33,936 INFO L78 Accepts]: Start accepts. Automaton has 185518 states and 660438 transitions. Word has length 56 [2019-12-19 04:00:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:33,936 INFO L462 AbstractCegarLoop]: Abstraction has 185518 states and 660438 transitions. [2019-12-19 04:00:33,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:00:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 185518 states and 660438 transitions. [2019-12-19 04:00:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 04:00:33,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:33,955 INFO L411 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] [2019-12-19 04:00:33,955 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:33,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:33,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1773278103, now seen corresponding path program 1 times [2019-12-19 04:00:33,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:33,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600326204] [2019-12-19 04:00:33,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:34,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600326204] [2019-12-19 04:00:34,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:34,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:34,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621809149] [2019-12-19 04:00:34,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:34,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:34,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:34,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:34,031 INFO L87 Difference]: Start difference. First operand 185518 states and 660438 transitions. Second operand 4 states. [2019-12-19 04:00:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:34,157 INFO L93 Difference]: Finished difference Result 24458 states and 76334 transitions. [2019-12-19 04:00:34,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:00:34,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-19 04:00:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:34,185 INFO L225 Difference]: With dead ends: 24458 [2019-12-19 04:00:34,185 INFO L226 Difference]: Without dead ends: 18439 [2019-12-19 04:00:34,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18439 states. [2019-12-19 04:00:35,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18439 to 18192. [2019-12-19 04:00:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18192 states. [2019-12-19 04:00:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18192 states to 18192 states and 54575 transitions. [2019-12-19 04:00:35,386 INFO L78 Accepts]: Start accepts. Automaton has 18192 states and 54575 transitions. Word has length 56 [2019-12-19 04:00:35,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:35,386 INFO L462 AbstractCegarLoop]: Abstraction has 18192 states and 54575 transitions. [2019-12-19 04:00:35,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 18192 states and 54575 transitions. [2019-12-19 04:00:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 04:00:35,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:35,391 INFO L411 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] [2019-12-19 04:00:35,391 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:35,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1597390281, now seen corresponding path program 1 times [2019-12-19 04:00:35,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:35,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124002456] [2019-12-19 04:00:35,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:35,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124002456] [2019-12-19 04:00:35,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:35,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:35,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222198650] [2019-12-19 04:00:35,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:35,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:35,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:35,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:35,442 INFO L87 Difference]: Start difference. First operand 18192 states and 54575 transitions. Second operand 4 states. [2019-12-19 04:00:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:35,686 INFO L93 Difference]: Finished difference Result 23512 states and 70753 transitions. [2019-12-19 04:00:35,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:00:35,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-19 04:00:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:35,721 INFO L225 Difference]: With dead ends: 23512 [2019-12-19 04:00:35,721 INFO L226 Difference]: Without dead ends: 23512 [2019-12-19 04:00:35,721 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 [2019-12-19 04:00:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23512 states. [2019-12-19 04:00:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23512 to 21214. [2019-12-19 04:00:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21214 states. [2019-12-19 04:00:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21214 states to 21214 states and 63560 transitions. [2019-12-19 04:00:36,040 INFO L78 Accepts]: Start accepts. Automaton has 21214 states and 63560 transitions. Word has length 65 [2019-12-19 04:00:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:36,040 INFO L462 AbstractCegarLoop]: Abstraction has 21214 states and 63560 transitions. [2019-12-19 04:00:36,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 21214 states and 63560 transitions. [2019-12-19 04:00:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 04:00:36,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:36,046 INFO L411 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] [2019-12-19 04:00:36,046 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:36,046 INFO L82 PathProgramCache]: Analyzing trace with hash -954766680, now seen corresponding path program 1 times [2019-12-19 04:00:36,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:36,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090866093] [2019-12-19 04:00:36,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:36,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090866093] [2019-12-19 04:00:36,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:36,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:00:36,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319941885] [2019-12-19 04:00:36,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:00:36,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:36,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:00:36,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:00:36,122 INFO L87 Difference]: Start difference. First operand 21214 states and 63560 transitions. Second operand 6 states. [2019-12-19 04:00:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:36,803 INFO L93 Difference]: Finished difference Result 30326 states and 89100 transitions. [2019-12-19 04:00:36,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:00:36,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-19 04:00:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:36,847 INFO L225 Difference]: With dead ends: 30326 [2019-12-19 04:00:36,847 INFO L226 Difference]: Without dead ends: 30278 [2019-12-19 04:00:36,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:00:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30278 states. [2019-12-19 04:00:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30278 to 27631. [2019-12-19 04:00:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27631 states. [2019-12-19 04:00:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 81447 transitions. [2019-12-19 04:00:39,270 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 81447 transitions. Word has length 65 [2019-12-19 04:00:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:39,270 INFO L462 AbstractCegarLoop]: Abstraction has 27631 states and 81447 transitions. [2019-12-19 04:00:39,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:00:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 81447 transitions. [2019-12-19 04:00:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 04:00:39,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:39,281 INFO L411 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] [2019-12-19 04:00:39,281 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:39,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:39,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1040500071, now seen corresponding path program 1 times [2019-12-19 04:00:39,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:39,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538551126] [2019-12-19 04:00:39,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:39,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538551126] [2019-12-19 04:00:39,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:39,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:00:39,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882124560] [2019-12-19 04:00:39,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:00:39,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:00:39,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:00:39,346 INFO L87 Difference]: Start difference. First operand 27631 states and 81447 transitions. Second operand 3 states. [2019-12-19 04:00:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:39,475 INFO L93 Difference]: Finished difference Result 30274 states and 87661 transitions. [2019-12-19 04:00:39,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:00:39,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-19 04:00:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:39,516 INFO L225 Difference]: With dead ends: 30274 [2019-12-19 04:00:39,516 INFO L226 Difference]: Without dead ends: 30274 [2019-12-19 04:00:39,517 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 [2019-12-19 04:00:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30274 states. [2019-12-19 04:00:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30274 to 26779. [2019-12-19 04:00:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26779 states. [2019-12-19 04:00:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26779 states to 26779 states and 76975 transitions. [2019-12-19 04:00:39,883 INFO L78 Accepts]: Start accepts. Automaton has 26779 states and 76975 transitions. Word has length 71 [2019-12-19 04:00:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:39,884 INFO L462 AbstractCegarLoop]: Abstraction has 26779 states and 76975 transitions. [2019-12-19 04:00:39,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:00:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 26779 states and 76975 transitions. [2019-12-19 04:00:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 04:00:39,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:39,896 INFO L411 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] [2019-12-19 04:00:39,897 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:39,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash 199326872, now seen corresponding path program 1 times [2019-12-19 04:00:39,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:39,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274996356] [2019-12-19 04:00:39,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:39,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274996356] [2019-12-19 04:00:39,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:39,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:39,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975940737] [2019-12-19 04:00:39,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:39,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:39,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:39,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:39,967 INFO L87 Difference]: Start difference. First operand 26779 states and 76975 transitions. Second operand 4 states. [2019-12-19 04:00:40,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:40,708 INFO L93 Difference]: Finished difference Result 35101 states and 101171 transitions. [2019-12-19 04:00:40,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:00:40,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-19 04:00:40,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:40,756 INFO L225 Difference]: With dead ends: 35101 [2019-12-19 04:00:40,756 INFO L226 Difference]: Without dead ends: 34678 [2019-12-19 04:00:40,756 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 [2019-12-19 04:00:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34678 states. [2019-12-19 04:00:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34678 to 32875. [2019-12-19 04:00:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32875 states. [2019-12-19 04:00:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32875 states to 32875 states and 94659 transitions. [2019-12-19 04:00:41,491 INFO L78 Accepts]: Start accepts. Automaton has 32875 states and 94659 transitions. Word has length 73 [2019-12-19 04:00:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:41,491 INFO L462 AbstractCegarLoop]: Abstraction has 32875 states and 94659 transitions. [2019-12-19 04:00:41,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 32875 states and 94659 transitions. [2019-12-19 04:00:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 04:00:41,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:41,504 INFO L411 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] [2019-12-19 04:00:41,504 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:41,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:41,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1597624487, now seen corresponding path program 1 times [2019-12-19 04:00:41,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:41,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645443854] [2019-12-19 04:00:41,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:41,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645443854] [2019-12-19 04:00:41,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:41,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:00:41,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069366604] [2019-12-19 04:00:41,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:00:41,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:41,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:00:41,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:41,641 INFO L87 Difference]: Start difference. First operand 32875 states and 94659 transitions. Second operand 8 states. [2019-12-19 04:00:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:42,880 INFO L93 Difference]: Finished difference Result 37960 states and 107978 transitions. [2019-12-19 04:00:42,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:00:42,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-12-19 04:00:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:42,933 INFO L225 Difference]: With dead ends: 37960 [2019-12-19 04:00:42,933 INFO L226 Difference]: Without dead ends: 37960 [2019-12-19 04:00:42,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:00:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37960 states. [2019-12-19 04:00:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37960 to 35135. [2019-12-19 04:00:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35135 states. [2019-12-19 04:00:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35135 states to 35135 states and 100532 transitions. [2019-12-19 04:00:43,422 INFO L78 Accepts]: Start accepts. Automaton has 35135 states and 100532 transitions. Word has length 73 [2019-12-19 04:00:43,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:43,422 INFO L462 AbstractCegarLoop]: Abstraction has 35135 states and 100532 transitions. [2019-12-19 04:00:43,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:00:43,422 INFO L276 IsEmpty]: Start isEmpty. Operand 35135 states and 100532 transitions. [2019-12-19 04:00:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 04:00:43,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:43,438 INFO L411 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] [2019-12-19 04:00:43,438 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:43,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:43,438 INFO L82 PathProgramCache]: Analyzing trace with hash -710120806, now seen corresponding path program 1 times [2019-12-19 04:00:43,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:43,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423095849] [2019-12-19 04:00:43,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:43,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423095849] [2019-12-19 04:00:43,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:43,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:00:43,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111028839] [2019-12-19 04:00:43,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:00:43,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:43,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:00:43,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:43,529 INFO L87 Difference]: Start difference. First operand 35135 states and 100532 transitions. Second operand 5 states. [2019-12-19 04:00:43,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:43,593 INFO L93 Difference]: Finished difference Result 10799 states and 26831 transitions. [2019-12-19 04:00:43,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:00:43,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-19 04:00:43,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:43,605 INFO L225 Difference]: With dead ends: 10799 [2019-12-19 04:00:43,605 INFO L226 Difference]: Without dead ends: 9416 [2019-12-19 04:00:43,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2019-12-19 04:00:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 7147. [2019-12-19 04:00:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7147 states. [2019-12-19 04:00:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7147 states to 7147 states and 17805 transitions. [2019-12-19 04:00:43,697 INFO L78 Accepts]: Start accepts. Automaton has 7147 states and 17805 transitions. Word has length 73 [2019-12-19 04:00:43,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:43,697 INFO L462 AbstractCegarLoop]: Abstraction has 7147 states and 17805 transitions. [2019-12-19 04:00:43,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:00:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 7147 states and 17805 transitions. [2019-12-19 04:00:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-19 04:00:43,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:43,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:43,705 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1912847230, now seen corresponding path program 1 times [2019-12-19 04:00:43,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:43,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937248981] [2019-12-19 04:00:43,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:43,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937248981] [2019-12-19 04:00:43,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:43,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:43,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038435845] [2019-12-19 04:00:43,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:43,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:43,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:43,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:43,779 INFO L87 Difference]: Start difference. First operand 7147 states and 17805 transitions. Second operand 4 states. [2019-12-19 04:00:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:44,111 INFO L93 Difference]: Finished difference Result 8303 states and 20316 transitions. [2019-12-19 04:00:44,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:00:44,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-19 04:00:44,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:44,123 INFO L225 Difference]: With dead ends: 8303 [2019-12-19 04:00:44,123 INFO L226 Difference]: Without dead ends: 8303 [2019-12-19 04:00:44,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2019-12-19 04:00:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 7769. [2019-12-19 04:00:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7769 states. [2019-12-19 04:00:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7769 states to 7769 states and 19157 transitions. [2019-12-19 04:00:44,219 INFO L78 Accepts]: Start accepts. Automaton has 7769 states and 19157 transitions. Word has length 102 [2019-12-19 04:00:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:44,220 INFO L462 AbstractCegarLoop]: Abstraction has 7769 states and 19157 transitions. [2019-12-19 04:00:44,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 7769 states and 19157 transitions. [2019-12-19 04:00:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-19 04:00:44,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:44,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:44,228 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:44,228 INFO L82 PathProgramCache]: Analyzing trace with hash -668082749, now seen corresponding path program 1 times [2019-12-19 04:00:44,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:44,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064510345] [2019-12-19 04:00:44,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:44,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064510345] [2019-12-19 04:00:44,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:44,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:00:44,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156589271] [2019-12-19 04:00:44,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:00:44,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:44,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:00:44,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:44,349 INFO L87 Difference]: Start difference. First operand 7769 states and 19157 transitions. Second operand 8 states. [2019-12-19 04:00:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:46,126 INFO L93 Difference]: Finished difference Result 16976 states and 40509 transitions. [2019-12-19 04:00:46,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 04:00:46,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-12-19 04:00:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:46,158 INFO L225 Difference]: With dead ends: 16976 [2019-12-19 04:00:46,158 INFO L226 Difference]: Without dead ends: 16885 [2019-12-19 04:00:46,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-12-19 04:00:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16885 states. [2019-12-19 04:00:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16885 to 13476. [2019-12-19 04:00:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13476 states. [2019-12-19 04:00:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13476 states to 13476 states and 32671 transitions. [2019-12-19 04:00:46,505 INFO L78 Accepts]: Start accepts. Automaton has 13476 states and 32671 transitions. Word has length 102 [2019-12-19 04:00:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:46,505 INFO L462 AbstractCegarLoop]: Abstraction has 13476 states and 32671 transitions. [2019-12-19 04:00:46,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:00:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 13476 states and 32671 transitions. [2019-12-19 04:00:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-19 04:00:46,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:46,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:46,530 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:46,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:46,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1549675204, now seen corresponding path program 1 times [2019-12-19 04:00:46,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:46,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702051825] [2019-12-19 04:00:46,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:46,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702051825] [2019-12-19 04:00:46,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:46,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:46,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16519804] [2019-12-19 04:00:46,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:46,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:46,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:46,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:46,709 INFO L87 Difference]: Start difference. First operand 13476 states and 32671 transitions. Second operand 7 states. [2019-12-19 04:00:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:47,395 INFO L93 Difference]: Finished difference Result 18441 states and 42781 transitions. [2019-12-19 04:00:47,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:00:47,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-19 04:00:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:47,427 INFO L225 Difference]: With dead ends: 18441 [2019-12-19 04:00:47,427 INFO L226 Difference]: Without dead ends: 18441 [2019-12-19 04:00:47,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:00:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18441 states. [2019-12-19 04:00:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18441 to 15695. [2019-12-19 04:00:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15695 states. [2019-12-19 04:00:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15695 states to 15695 states and 36950 transitions. [2019-12-19 04:00:47,819 INFO L78 Accepts]: Start accepts. Automaton has 15695 states and 36950 transitions. Word has length 102 [2019-12-19 04:00:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:47,820 INFO L462 AbstractCegarLoop]: Abstraction has 15695 states and 36950 transitions. [2019-12-19 04:00:47,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 15695 states and 36950 transitions. [2019-12-19 04:00:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-19 04:00:47,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:47,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:47,853 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1761026117, now seen corresponding path program 1 times [2019-12-19 04:00:47,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:47,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553835604] [2019-12-19 04:00:47,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:47,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553835604] [2019-12-19 04:00:47,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:47,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:47,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720199573] [2019-12-19 04:00:47,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:47,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:47,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:47,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:47,983 INFO L87 Difference]: Start difference. First operand 15695 states and 36950 transitions. Second operand 7 states. [2019-12-19 04:00:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:48,869 INFO L93 Difference]: Finished difference Result 17472 states and 40899 transitions. [2019-12-19 04:00:48,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:00:48,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-19 04:00:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:48,893 INFO L225 Difference]: With dead ends: 17472 [2019-12-19 04:00:48,894 INFO L226 Difference]: Without dead ends: 17472 [2019-12-19 04:00:48,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-19 04:00:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17472 states. [2019-12-19 04:00:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17472 to 16249. [2019-12-19 04:00:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16249 states. [2019-12-19 04:00:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16249 states to 16249 states and 38165 transitions. [2019-12-19 04:00:49,127 INFO L78 Accepts]: Start accepts. Automaton has 16249 states and 38165 transitions. Word has length 102 [2019-12-19 04:00:49,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:49,128 INFO L462 AbstractCegarLoop]: Abstraction has 16249 states and 38165 transitions. [2019-12-19 04:00:49,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 16249 states and 38165 transitions. [2019-12-19 04:00:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-19 04:00:49,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:49,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:49,143 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:49,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:49,143 INFO L82 PathProgramCache]: Analyzing trace with hash -546459419, now seen corresponding path program 1 times [2019-12-19 04:00:49,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:49,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510304394] [2019-12-19 04:00:49,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:49,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510304394] [2019-12-19 04:00:49,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:49,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:49,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053070015] [2019-12-19 04:00:49,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:49,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:49,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:49,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:49,282 INFO L87 Difference]: Start difference. First operand 16249 states and 38165 transitions. Second operand 7 states. [2019-12-19 04:00:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:49,627 INFO L93 Difference]: Finished difference Result 16994 states and 39687 transitions. [2019-12-19 04:00:49,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:00:49,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-19 04:00:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:49,650 INFO L225 Difference]: With dead ends: 16994 [2019-12-19 04:00:49,651 INFO L226 Difference]: Without dead ends: 16994 [2019-12-19 04:00:49,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:00:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16994 states. [2019-12-19 04:00:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16994 to 15722. [2019-12-19 04:00:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15722 states. [2019-12-19 04:00:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15722 states to 15722 states and 36946 transitions. [2019-12-19 04:00:49,840 INFO L78 Accepts]: Start accepts. Automaton has 15722 states and 36946 transitions. Word has length 102 [2019-12-19 04:00:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:49,840 INFO L462 AbstractCegarLoop]: Abstraction has 15722 states and 36946 transitions. [2019-12-19 04:00:49,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 15722 states and 36946 transitions. [2019-12-19 04:00:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-19 04:00:49,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:49,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:49,855 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash 341044262, now seen corresponding path program 1 times [2019-12-19 04:00:49,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:49,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689713460] [2019-12-19 04:00:49,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:49,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689713460] [2019-12-19 04:00:49,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:49,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:00:49,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136242143] [2019-12-19 04:00:49,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:00:49,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:00:49,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:49,941 INFO L87 Difference]: Start difference. First operand 15722 states and 36946 transitions. Second operand 4 states. [2019-12-19 04:00:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:50,197 INFO L93 Difference]: Finished difference Result 16178 states and 37971 transitions. [2019-12-19 04:00:50,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:00:50,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-19 04:00:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:50,215 INFO L225 Difference]: With dead ends: 16178 [2019-12-19 04:00:50,215 INFO L226 Difference]: Without dead ends: 16178 [2019-12-19 04:00:50,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:00:50,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16178 states. [2019-12-19 04:00:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16178 to 15065. [2019-12-19 04:00:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15065 states. [2019-12-19 04:00:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15065 states to 15065 states and 35475 transitions. [2019-12-19 04:00:50,386 INFO L78 Accepts]: Start accepts. Automaton has 15065 states and 35475 transitions. Word has length 102 [2019-12-19 04:00:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:50,386 INFO L462 AbstractCegarLoop]: Abstraction has 15065 states and 35475 transitions. [2019-12-19 04:00:50,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:00:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 15065 states and 35475 transitions. [2019-12-19 04:00:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-19 04:00:50,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:50,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:50,399 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:50,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:50,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1396104546, now seen corresponding path program 2 times [2019-12-19 04:00:50,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:50,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484627098] [2019-12-19 04:00:50,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:50,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484627098] [2019-12-19 04:00:50,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:50,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:00:50,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804692575] [2019-12-19 04:00:50,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:00:50,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:50,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:00:50,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:00:50,453 INFO L87 Difference]: Start difference. First operand 15065 states and 35475 transitions. Second operand 3 states. [2019-12-19 04:00:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:50,526 INFO L93 Difference]: Finished difference Result 18105 states and 42480 transitions. [2019-12-19 04:00:50,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:00:50,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-12-19 04:00:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:50,556 INFO L225 Difference]: With dead ends: 18105 [2019-12-19 04:00:50,556 INFO L226 Difference]: Without dead ends: 18105 [2019-12-19 04:00:50,556 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 [2019-12-19 04:00:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18105 states. [2019-12-19 04:00:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18105 to 18023. [2019-12-19 04:00:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18023 states. [2019-12-19 04:00:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18023 states to 18023 states and 42302 transitions. [2019-12-19 04:00:51,007 INFO L78 Accepts]: Start accepts. Automaton has 18023 states and 42302 transitions. Word has length 102 [2019-12-19 04:00:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:51,007 INFO L462 AbstractCegarLoop]: Abstraction has 18023 states and 42302 transitions. [2019-12-19 04:00:51,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:00:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 18023 states and 42302 transitions. [2019-12-19 04:00:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-19 04:00:51,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:51,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:51,033 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:51,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1045304609, now seen corresponding path program 1 times [2019-12-19 04:00:51,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:51,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523134399] [2019-12-19 04:00:51,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:51,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523134399] [2019-12-19 04:00:51,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:51,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:00:51,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062398883] [2019-12-19 04:00:51,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:00:51,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:51,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:00:51,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:51,125 INFO L87 Difference]: Start difference. First operand 18023 states and 42302 transitions. Second operand 5 states. [2019-12-19 04:00:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:51,476 INFO L93 Difference]: Finished difference Result 19443 states and 45299 transitions. [2019-12-19 04:00:51,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:00:51,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-12-19 04:00:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:51,500 INFO L225 Difference]: With dead ends: 19443 [2019-12-19 04:00:51,500 INFO L226 Difference]: Without dead ends: 19443 [2019-12-19 04:00:51,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:00:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19443 states. [2019-12-19 04:00:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19443 to 17991. [2019-12-19 04:00:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17991 states. [2019-12-19 04:00:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17991 states to 17991 states and 42170 transitions. [2019-12-19 04:00:51,697 INFO L78 Accepts]: Start accepts. Automaton has 17991 states and 42170 transitions. Word has length 102 [2019-12-19 04:00:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:51,698 INFO L462 AbstractCegarLoop]: Abstraction has 17991 states and 42170 transitions. [2019-12-19 04:00:51,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:00:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 17991 states and 42170 transitions. [2019-12-19 04:00:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-19 04:00:51,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:51,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:51,714 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1752276477, now seen corresponding path program 2 times [2019-12-19 04:00:51,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:51,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104025535] [2019-12-19 04:00:51,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:51,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104025535] [2019-12-19 04:00:51,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:51,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:00:51,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285676913] [2019-12-19 04:00:51,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:00:51,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:51,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:00:51,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:00:51,787 INFO L87 Difference]: Start difference. First operand 17991 states and 42170 transitions. Second operand 6 states. [2019-12-19 04:00:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:52,170 INFO L93 Difference]: Finished difference Result 21095 states and 49214 transitions. [2019-12-19 04:00:52,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:00:52,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-12-19 04:00:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:52,193 INFO L225 Difference]: With dead ends: 21095 [2019-12-19 04:00:52,195 INFO L226 Difference]: Without dead ends: 21095 [2019-12-19 04:00:52,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21095 states. [2019-12-19 04:00:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21095 to 17990. [2019-12-19 04:00:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17990 states. [2019-12-19 04:00:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17990 states to 17990 states and 42146 transitions. [2019-12-19 04:00:52,403 INFO L78 Accepts]: Start accepts. Automaton has 17990 states and 42146 transitions. Word has length 102 [2019-12-19 04:00:52,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:52,403 INFO L462 AbstractCegarLoop]: Abstraction has 17990 states and 42146 transitions. [2019-12-19 04:00:52,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:00:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 17990 states and 42146 transitions. [2019-12-19 04:00:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-19 04:00:52,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:52,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:52,420 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1928272137, now seen corresponding path program 3 times [2019-12-19 04:00:52,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:52,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301885825] [2019-12-19 04:00:52,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:52,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301885825] [2019-12-19 04:00:52,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:52,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:00:52,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907915333] [2019-12-19 04:00:52,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:00:52,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:00:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:52,482 INFO L87 Difference]: Start difference. First operand 17990 states and 42146 transitions. Second operand 5 states. [2019-12-19 04:00:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:52,819 INFO L93 Difference]: Finished difference Result 19805 states and 45845 transitions. [2019-12-19 04:00:52,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:00:52,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-12-19 04:00:52,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:52,850 INFO L225 Difference]: With dead ends: 19805 [2019-12-19 04:00:52,850 INFO L226 Difference]: Without dead ends: 19805 [2019-12-19 04:00:52,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19805 states. [2019-12-19 04:00:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19805 to 18145. [2019-12-19 04:00:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18145 states. [2019-12-19 04:00:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18145 states to 18145 states and 42454 transitions. [2019-12-19 04:00:53,224 INFO L78 Accepts]: Start accepts. Automaton has 18145 states and 42454 transitions. Word has length 102 [2019-12-19 04:00:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:53,224 INFO L462 AbstractCegarLoop]: Abstraction has 18145 states and 42454 transitions. [2019-12-19 04:00:53,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:00:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 18145 states and 42454 transitions. [2019-12-19 04:00:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-19 04:00:53,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:53,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:53,240 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:53,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash -279356980, now seen corresponding path program 1 times [2019-12-19 04:00:53,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:53,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663280984] [2019-12-19 04:00:53,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:53,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663280984] [2019-12-19 04:00:53,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:53,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:00:53,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325403998] [2019-12-19 04:00:53,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:00:53,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:53,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:00:53,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:00:53,417 INFO L87 Difference]: Start difference. First operand 18145 states and 42454 transitions. Second operand 11 states. [2019-12-19 04:00:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:54,016 INFO L93 Difference]: Finished difference Result 37532 states and 86843 transitions. [2019-12-19 04:00:54,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-19 04:00:54,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-12-19 04:00:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:54,050 INFO L225 Difference]: With dead ends: 37532 [2019-12-19 04:00:54,050 INFO L226 Difference]: Without dead ends: 30918 [2019-12-19 04:00:54,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2019-12-19 04:00:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30918 states. [2019-12-19 04:00:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30918 to 23484. [2019-12-19 04:00:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23484 states. [2019-12-19 04:00:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23484 states to 23484 states and 54900 transitions. [2019-12-19 04:00:54,383 INFO L78 Accepts]: Start accepts. Automaton has 23484 states and 54900 transitions. Word has length 104 [2019-12-19 04:00:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:54,383 INFO L462 AbstractCegarLoop]: Abstraction has 23484 states and 54900 transitions. [2019-12-19 04:00:54,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:00:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 23484 states and 54900 transitions. [2019-12-19 04:00:54,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-19 04:00:54,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:54,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:54,406 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:54,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1718959178, now seen corresponding path program 2 times [2019-12-19 04:00:54,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:54,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920514119] [2019-12-19 04:00:54,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:54,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920514119] [2019-12-19 04:00:54,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:54,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-19 04:00:54,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310929657] [2019-12-19 04:00:54,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-19 04:00:54,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:54,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-19 04:00:54,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:00:54,622 INFO L87 Difference]: Start difference. First operand 23484 states and 54900 transitions. Second operand 12 states. [2019-12-19 04:00:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:55,530 INFO L93 Difference]: Finished difference Result 43001 states and 99387 transitions. [2019-12-19 04:00:55,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-19 04:00:55,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-12-19 04:00:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:55,573 INFO L225 Difference]: With dead ends: 43001 [2019-12-19 04:00:55,573 INFO L226 Difference]: Without dead ends: 39839 [2019-12-19 04:00:55,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2019-12-19 04:00:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39839 states. [2019-12-19 04:00:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39839 to 27655. [2019-12-19 04:00:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27655 states. [2019-12-19 04:00:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27655 states to 27655 states and 64719 transitions. [2019-12-19 04:00:56,097 INFO L78 Accepts]: Start accepts. Automaton has 27655 states and 64719 transitions. Word has length 104 [2019-12-19 04:00:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:56,097 INFO L462 AbstractCegarLoop]: Abstraction has 27655 states and 64719 transitions. [2019-12-19 04:00:56,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-19 04:00:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 27655 states and 64719 transitions. [2019-12-19 04:00:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-19 04:00:56,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:56,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:56,126 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:56,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:56,126 INFO L82 PathProgramCache]: Analyzing trace with hash -42251132, now seen corresponding path program 1 times [2019-12-19 04:00:56,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:56,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700825906] [2019-12-19 04:00:56,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:56,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700825906] [2019-12-19 04:00:56,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:56,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:00:56,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366237688] [2019-12-19 04:00:56,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:00:56,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:56,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:00:56,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:56,269 INFO L87 Difference]: Start difference. First operand 27655 states and 64719 transitions. Second operand 8 states. [2019-12-19 04:00:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:56,491 INFO L93 Difference]: Finished difference Result 28196 states and 65908 transitions. [2019-12-19 04:00:56,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:00:56,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-12-19 04:00:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:56,498 INFO L225 Difference]: With dead ends: 28196 [2019-12-19 04:00:56,498 INFO L226 Difference]: Without dead ends: 3281 [2019-12-19 04:00:56,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:00:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2019-12-19 04:00:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3279. [2019-12-19 04:00:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3279 states. [2019-12-19 04:00:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 7705 transitions. [2019-12-19 04:00:56,546 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 7705 transitions. Word has length 104 [2019-12-19 04:00:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:56,546 INFO L462 AbstractCegarLoop]: Abstraction has 3279 states and 7705 transitions. [2019-12-19 04:00:56,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:00:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 7705 transitions. [2019-12-19 04:00:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-19 04:00:56,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:56,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:56,551 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:56,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1669148943, now seen corresponding path program 1 times [2019-12-19 04:00:56,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:56,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691956631] [2019-12-19 04:00:56,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:56,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691956631] [2019-12-19 04:00:56,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:56,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:00:56,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402717474] [2019-12-19 04:00:56,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:00:56,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:56,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:00:56,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:00:56,629 INFO L87 Difference]: Start difference. First operand 3279 states and 7705 transitions. Second operand 5 states. [2019-12-19 04:00:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:56,850 INFO L93 Difference]: Finished difference Result 3604 states and 8397 transitions. [2019-12-19 04:00:56,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:00:56,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-12-19 04:00:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:56,854 INFO L225 Difference]: With dead ends: 3604 [2019-12-19 04:00:56,854 INFO L226 Difference]: Without dead ends: 3582 [2019-12-19 04:00:56,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:00:56,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2019-12-19 04:00:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3331. [2019-12-19 04:00:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2019-12-19 04:00:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 7821 transitions. [2019-12-19 04:00:56,888 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 7821 transitions. Word has length 104 [2019-12-19 04:00:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:56,888 INFO L462 AbstractCegarLoop]: Abstraction has 3331 states and 7821 transitions. [2019-12-19 04:00:56,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:00:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 7821 transitions. [2019-12-19 04:00:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-19 04:00:56,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:56,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:56,892 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash 191962205, now seen corresponding path program 1 times [2019-12-19 04:00:56,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:56,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970061554] [2019-12-19 04:00:56,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:57,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970061554] [2019-12-19 04:00:57,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:57,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 04:00:57,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713803492] [2019-12-19 04:00:57,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 04:00:57,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:57,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 04:00:57,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:00:57,049 INFO L87 Difference]: Start difference. First operand 3331 states and 7821 transitions. Second operand 10 states. [2019-12-19 04:00:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:57,972 INFO L93 Difference]: Finished difference Result 4301 states and 9801 transitions. [2019-12-19 04:00:57,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:00:57,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-12-19 04:00:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:57,978 INFO L225 Difference]: With dead ends: 4301 [2019-12-19 04:00:57,978 INFO L226 Difference]: Without dead ends: 4301 [2019-12-19 04:00:57,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-19 04:00:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2019-12-19 04:00:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 3486. [2019-12-19 04:00:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2019-12-19 04:00:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 8127 transitions. [2019-12-19 04:00:58,015 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 8127 transitions. Word has length 104 [2019-12-19 04:00:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:58,016 INFO L462 AbstractCegarLoop]: Abstraction has 3486 states and 8127 transitions. [2019-12-19 04:00:58,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 04:00:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 8127 transitions. [2019-12-19 04:00:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-19 04:00:58,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:58,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:58,019 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:58,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1079465886, now seen corresponding path program 1 times [2019-12-19 04:00:58,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:58,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28590522] [2019-12-19 04:00:58,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:58,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28590522] [2019-12-19 04:00:58,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:58,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:00:58,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846155393] [2019-12-19 04:00:58,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:00:58,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:58,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:00:58,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:00:58,095 INFO L87 Difference]: Start difference. First operand 3486 states and 8127 transitions. Second operand 7 states. [2019-12-19 04:00:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:58,454 INFO L93 Difference]: Finished difference Result 3862 states and 8884 transitions. [2019-12-19 04:00:58,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:00:58,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-12-19 04:00:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:58,460 INFO L225 Difference]: With dead ends: 3862 [2019-12-19 04:00:58,460 INFO L226 Difference]: Without dead ends: 3862 [2019-12-19 04:00:58,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2019-12-19 04:00:58,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3427. [2019-12-19 04:00:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-12-19 04:00:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 8008 transitions. [2019-12-19 04:00:58,511 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 8008 transitions. Word has length 104 [2019-12-19 04:00:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:58,511 INFO L462 AbstractCegarLoop]: Abstraction has 3427 states and 8008 transitions. [2019-12-19 04:00:58,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:00:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 8008 transitions. [2019-12-19 04:00:58,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-19 04:00:58,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:58,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:58,516 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:58,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1562239622, now seen corresponding path program 1 times [2019-12-19 04:00:58,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:58,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257225925] [2019-12-19 04:00:58,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:58,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257225925] [2019-12-19 04:00:58,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:58,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:00:58,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699539452] [2019-12-19 04:00:58,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:00:58,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:58,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:00:58,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:00:58,670 INFO L87 Difference]: Start difference. First operand 3427 states and 8008 transitions. Second operand 8 states. [2019-12-19 04:00:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:59,129 INFO L93 Difference]: Finished difference Result 3710 states and 8622 transitions. [2019-12-19 04:00:59,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:00:59,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-12-19 04:00:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:59,137 INFO L225 Difference]: With dead ends: 3710 [2019-12-19 04:00:59,137 INFO L226 Difference]: Without dead ends: 3710 [2019-12-19 04:00:59,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-12-19 04:00:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2019-12-19 04:00:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3382. [2019-12-19 04:00:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-12-19 04:00:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 7925 transitions. [2019-12-19 04:00:59,217 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 7925 transitions. Word has length 104 [2019-12-19 04:00:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:59,217 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 7925 transitions. [2019-12-19 04:00:59,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:00:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 7925 transitions. [2019-12-19 04:00:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-19 04:00:59,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:59,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:59,225 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:59,225 INFO L82 PathProgramCache]: Analyzing trace with hash -674735941, now seen corresponding path program 1 times [2019-12-19 04:00:59,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:00:59,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390324379] [2019-12-19 04:00:59,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:00:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:00:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:00:59,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390324379] [2019-12-19 04:00:59,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:00:59,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:00:59,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494751187] [2019-12-19 04:00:59,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:00:59,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:00:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:00:59,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:00:59,472 INFO L87 Difference]: Start difference. First operand 3382 states and 7925 transitions. Second operand 11 states. [2019-12-19 04:00:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:00:59,922 INFO L93 Difference]: Finished difference Result 5297 states and 12163 transitions. [2019-12-19 04:00:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:00:59,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-12-19 04:00:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:00:59,928 INFO L225 Difference]: With dead ends: 5297 [2019-12-19 04:00:59,928 INFO L226 Difference]: Without dead ends: 3892 [2019-12-19 04:00:59,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-19 04:00:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2019-12-19 04:00:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3438. [2019-12-19 04:00:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3438 states. [2019-12-19 04:00:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 7987 transitions. [2019-12-19 04:00:59,981 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 7987 transitions. Word has length 104 [2019-12-19 04:00:59,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:00:59,981 INFO L462 AbstractCegarLoop]: Abstraction has 3438 states and 7987 transitions. [2019-12-19 04:00:59,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:00:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 7987 transitions. [2019-12-19 04:00:59,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-19 04:00:59,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:00:59,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:00:59,995 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:00:59,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:00:59,996 INFO L82 PathProgramCache]: Analyzing trace with hash -724916487, now seen corresponding path program 2 times [2019-12-19 04:00:59,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:01:00,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501043837] [2019-12-19 04:01:00,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:01:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:01:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:01:00,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 04:01:00,156 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 04:01:00,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:01:00 BasicIcfg [2019-12-19 04:01:00,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 04:01:00,387 INFO L168 Benchmark]: Toolchain (without parser) took 147092.63 ms. Allocated memory was 146.3 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 101.5 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 04:01:00,387 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 04:01:00,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.32 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.1 MB in the beginning and 158.1 MB in the end (delta: -57.0 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:00,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.25 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 154.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:00,388 INFO L168 Benchmark]: Boogie Preprocessor took 40.48 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:00,389 INFO L168 Benchmark]: RCFGBuilder took 908.68 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 99.3 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2019-12-19 04:01:00,389 INFO L168 Benchmark]: TraceAbstraction took 145253.54 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.3 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 04:01:00,391 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.32 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.1 MB in the beginning and 158.1 MB in the end (delta: -57.0 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.25 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 154.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.48 ms. Allocated memory is still 204.5 MB. Free memory was 154.8 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 908.68 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 99.3 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 145253.54 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.3 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 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: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L711] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L712] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L713] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L714] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L715] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L716] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L717] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L718] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L719] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L720] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L721] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L722] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L723] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 pthread_t t1723; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 pthread_t t1724; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 1 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L793] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 144.8s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 55.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12815 SDtfs, 15113 SDslu, 37740 SDs, 0 SdLazy, 12637 SolverSat, 646 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 102 SyntacticMatches, 23 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222094occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 75.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 242331 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2896 NumberOfCodeBlocks, 2896 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2758 ConstructedInterpolants, 0 QuantifiedInterpolants, 649666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...