/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:24:33,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:24:33,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:24:33,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:24:33,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:24:33,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:24:33,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:24:33,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:24:33,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:24:33,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:24:33,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:24:33,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:24:33,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:24:33,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:24:33,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:24:33,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:24:33,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:24:33,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:24:33,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:24:33,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:24:33,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:24:33,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:24:33,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:24:33,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:24:33,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:24:33,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:24:33,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:24:33,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:24:33,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:24:33,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:24:33,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:24:33,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:24:33,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:24:33,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:24:33,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:24:33,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:24:33,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:24:33,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:24:33,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:24:33,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:24:33,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:24:33,069 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:24:33,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:24:33,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:24:33,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:24:33,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:24:33,093 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:24:33,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:24:33,094 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:24:33,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:24:33,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:24:33,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:24:33,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:24:33,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:24:33,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:24:33,096 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:24:33,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:24:33,097 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:24:33,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:24:33,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:24:33,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:24:33,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:24:33,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:24:33,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:24:33,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:24:33,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:24:33,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:24:33,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:24:33,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:24:33,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:24:33,099 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:24:33,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:24:33,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:24:33,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:24:33,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:24:33,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:24:33,417 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:24:33,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.opt.i [2019-12-18 14:24:33,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4055134e5/b3ba7450cf364273a4df42eae2a94180/FLAG61f72b282 [2019-12-18 14:24:34,099 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:24:34,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_pso.opt.i [2019-12-18 14:24:34,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4055134e5/b3ba7450cf364273a4df42eae2a94180/FLAG61f72b282 [2019-12-18 14:24:34,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4055134e5/b3ba7450cf364273a4df42eae2a94180 [2019-12-18 14:24:34,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:24:34,367 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:24:34,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:24:34,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:24:34,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:24:34,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:24:34" (1/1) ... [2019-12-18 14:24:34,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c74ec19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:34, skipping insertion in model container [2019-12-18 14:24:34,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:24:34" (1/1) ... [2019-12-18 14:24:34,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:24:34,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:24:34,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:24:34,994 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:24:35,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:24:35,162 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:24:35,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35 WrapperNode [2019-12-18 14:24:35,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:24:35,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:24:35,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:24:35,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:24:35,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35" (1/1) ... [2019-12-18 14:24:35,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35" (1/1) ... [2019-12-18 14:24:35,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:24:35,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:24:35,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:24:35,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:24:35,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35" (1/1) ... [2019-12-18 14:24:35,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35" (1/1) ... [2019-12-18 14:24:35,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35" (1/1) ... [2019-12-18 14:24:35,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35" (1/1) ... [2019-12-18 14:24:35,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35" (1/1) ... [2019-12-18 14:24:35,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35" (1/1) ... [2019-12-18 14:24:35,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35" (1/1) ... [2019-12-18 14:24:35,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:24:35,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:24:35,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:24:35,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:24:35,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35" (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-18 14:24:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:24:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:24:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:24:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:24:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:24:35,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:24:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:24:35,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:24:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:24:35,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:24:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:24:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:24:35,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:24:35,332 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:24:36,049 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:24:36,049 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:24:36,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:24:36 BoogieIcfgContainer [2019-12-18 14:24:36,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:24:36,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:24:36,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:24:36,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:24:36,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:24:34" (1/3) ... [2019-12-18 14:24:36,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f38aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:24:36, skipping insertion in model container [2019-12-18 14:24:36,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:24:35" (2/3) ... [2019-12-18 14:24:36,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f38aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:24:36, skipping insertion in model container [2019-12-18 14:24:36,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:24:36" (3/3) ... [2019-12-18 14:24:36,059 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_pso.opt.i [2019-12-18 14:24:36,070 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:24:36,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:24:36,078 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:24:36,079 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:24:36,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,144 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,144 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,145 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,145 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,153 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,153 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,164 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,164 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,180 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,185 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,186 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:24:36,207 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:24:36,226 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:24:36,226 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:24:36,226 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:24:36,226 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:24:36,226 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:24:36,227 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:24:36,227 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:24:36,227 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:24:36,243 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 14:24:36,245 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:24:36,334 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:24:36,334 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:24:36,358 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:24:36,384 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:24:36,464 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:24:36,464 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:24:36,472 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:24:36,491 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:24:36,492 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:24:40,514 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-12-18 14:24:42,045 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:24:42,148 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:24:42,170 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-18 14:24:42,170 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 14:24:42,174 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 14:24:52,271 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-18 14:24:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-18 14:24:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:24:52,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:24:52,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:24:52,281 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:24:52,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:24:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-18 14:24:52,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:24:52,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439688973] [2019-12-18 14:24:52,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:24:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:24:52,537 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-18 14:24:52,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439688973] [2019-12-18 14:24:52,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:24:52,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:24:52,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704132693] [2019-12-18 14:24:52,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:24:52,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:24:52,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:24:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:24:52,564 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-18 14:24:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:24:53,856 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-18 14:24:53,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:24:53,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:24:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:24:56,674 INFO L225 Difference]: With dead ends: 79498 [2019-12-18 14:24:56,674 INFO L226 Difference]: Without dead ends: 74626 [2019-12-18 14:24:56,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-18 14:24:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-18 14:25:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-18 14:25:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-18 14:25:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-18 14:25:02,014 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-18 14:25:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:02,014 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-18 14:25:02,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:02,014 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-18 14:25:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:25:02,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:02,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:02,025 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:02,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:02,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-18 14:25:02,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:02,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644386698] [2019-12-18 14:25:02,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:02,090 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-18 14:25:02,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644386698] [2019-12-18 14:25:02,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:02,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:25:02,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140591785] [2019-12-18 14:25:02,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:25:02,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:25:02,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:25:02,095 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 3 states. [2019-12-18 14:25:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:02,358 INFO L93 Difference]: Finished difference Result 19918 states and 69198 transitions. [2019-12-18 14:25:02,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:25:02,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:25:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:02,465 INFO L225 Difference]: With dead ends: 19918 [2019-12-18 14:25:02,465 INFO L226 Difference]: Without dead ends: 19918 [2019-12-18 14:25:02,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-18 14:25:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-18 14:25:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 19918. [2019-12-18 14:25:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19918 states. [2019-12-18 14:25:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 69198 transitions. [2019-12-18 14:25:05,690 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 69198 transitions. Word has length 13 [2019-12-18 14:25:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:05,691 INFO L462 AbstractCegarLoop]: Abstraction has 19918 states and 69198 transitions. [2019-12-18 14:25:05,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 69198 transitions. [2019-12-18 14:25:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:25:05,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:05,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:05,693 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:05,693 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-18 14:25:05,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:05,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325162657] [2019-12-18 14:25:05,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:05,803 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-18 14:25:05,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325162657] [2019-12-18 14:25:05,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:05,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:25:05,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574682416] [2019-12-18 14:25:05,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:25:05,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:05,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:25:05,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:25:05,805 INFO L87 Difference]: Start difference. First operand 19918 states and 69198 transitions. Second operand 4 states. [2019-12-18 14:25:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:06,148 INFO L93 Difference]: Finished difference Result 29603 states and 99212 transitions. [2019-12-18 14:25:06,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:25:06,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:25:06,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:06,303 INFO L225 Difference]: With dead ends: 29603 [2019-12-18 14:25:06,303 INFO L226 Difference]: Without dead ends: 29589 [2019-12-18 14:25:06,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 14:25:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2019-12-18 14:25:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 26899. [2019-12-18 14:25:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26899 states. [2019-12-18 14:25:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26899 states to 26899 states and 90919 transitions. [2019-12-18 14:25:07,186 INFO L78 Accepts]: Start accepts. Automaton has 26899 states and 90919 transitions. Word has length 13 [2019-12-18 14:25:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:07,187 INFO L462 AbstractCegarLoop]: Abstraction has 26899 states and 90919 transitions. [2019-12-18 14:25:07,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:25:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 26899 states and 90919 transitions. [2019-12-18 14:25:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:25:07,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:07,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:25:07,189 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-18 14:25:07,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:07,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356159340] [2019-12-18 14:25:07,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:07,317 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-18 14:25:07,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356159340] [2019-12-18 14:25:07,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:07,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:25:07,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650495276] [2019-12-18 14:25:07,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:25:07,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:07,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:25:07,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:25:07,325 INFO L87 Difference]: Start difference. First operand 26899 states and 90919 transitions. Second operand 5 states. [2019-12-18 14:25:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:08,023 INFO L93 Difference]: Finished difference Result 40028 states and 132579 transitions. [2019-12-18 14:25:08,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:25:08,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 14:25:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:08,119 INFO L225 Difference]: With dead ends: 40028 [2019-12-18 14:25:08,120 INFO L226 Difference]: Without dead ends: 40010 [2019-12-18 14:25:08,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-18 14:25:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2019-12-18 14:25:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 31276. [2019-12-18 14:25:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31276 states. [2019-12-18 14:25:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31276 states to 31276 states and 104921 transitions. [2019-12-18 14:25:09,023 INFO L78 Accepts]: Start accepts. Automaton has 31276 states and 104921 transitions. Word has length 14 [2019-12-18 14:25:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:09,024 INFO L462 AbstractCegarLoop]: Abstraction has 31276 states and 104921 transitions. [2019-12-18 14:25:09,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:25:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 31276 states and 104921 transitions. [2019-12-18 14:25:09,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:25:09,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:09,036 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] [2019-12-18 14:25:09,036 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:09,036 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-18 14:25:09,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:09,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214549341] [2019-12-18 14:25:09,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:09,231 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-18 14:25:09,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214549341] [2019-12-18 14:25:09,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:09,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:25:09,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095947775] [2019-12-18 14:25:09,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:25:09,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:09,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:25:09,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:25:09,234 INFO L87 Difference]: Start difference. First operand 31276 states and 104921 transitions. Second operand 6 states. [2019-12-18 14:25:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:10,344 INFO L93 Difference]: Finished difference Result 54414 states and 177321 transitions. [2019-12-18 14:25:10,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:25:10,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 14:25:10,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:10,436 INFO L225 Difference]: With dead ends: 54414 [2019-12-18 14:25:10,436 INFO L226 Difference]: Without dead ends: 54384 [2019-12-18 14:25:10,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:25:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54384 states. [2019-12-18 14:25:11,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54384 to 36377. [2019-12-18 14:25:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36377 states. [2019-12-18 14:25:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 120495 transitions. [2019-12-18 14:25:11,259 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 120495 transitions. Word has length 22 [2019-12-18 14:25:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:11,259 INFO L462 AbstractCegarLoop]: Abstraction has 36377 states and 120495 transitions. [2019-12-18 14:25:11,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:25:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 120495 transitions. [2019-12-18 14:25:11,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:25:11,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:11,269 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] [2019-12-18 14:25:11,269 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:11,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:11,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2022809675, now seen corresponding path program 2 times [2019-12-18 14:25:11,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:11,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004106762] [2019-12-18 14:25:11,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:11,401 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-18 14:25:11,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004106762] [2019-12-18 14:25:11,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:11,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:25:11,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210791905] [2019-12-18 14:25:11,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:25:11,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:11,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:25:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:25:11,404 INFO L87 Difference]: Start difference. First operand 36377 states and 120495 transitions. Second operand 7 states. [2019-12-18 14:25:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:12,514 INFO L93 Difference]: Finished difference Result 54885 states and 178707 transitions. [2019-12-18 14:25:12,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:25:12,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 14:25:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:12,645 INFO L225 Difference]: With dead ends: 54885 [2019-12-18 14:25:12,645 INFO L226 Difference]: Without dead ends: 54843 [2019-12-18 14:25:12,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:25:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54843 states. [2019-12-18 14:25:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54843 to 31795. [2019-12-18 14:25:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2019-12-18 14:25:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 106002 transitions. [2019-12-18 14:25:13,329 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 106002 transitions. Word has length 22 [2019-12-18 14:25:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:13,329 INFO L462 AbstractCegarLoop]: Abstraction has 31795 states and 106002 transitions. [2019-12-18 14:25:13,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:25:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 106002 transitions. [2019-12-18 14:25:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:25:13,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:13,340 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] [2019-12-18 14:25:13,341 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:13,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:13,341 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-18 14:25:13,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:13,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450630963] [2019-12-18 14:25:13,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:13,385 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-18 14:25:13,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450630963] [2019-12-18 14:25:13,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:13,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:25:13,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474194747] [2019-12-18 14:25:13,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:25:13,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:13,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:25:13,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:25:13,388 INFO L87 Difference]: Start difference. First operand 31795 states and 106002 transitions. Second operand 4 states. [2019-12-18 14:25:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:13,449 INFO L93 Difference]: Finished difference Result 12400 states and 38387 transitions. [2019-12-18 14:25:13,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:25:13,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:25:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:13,471 INFO L225 Difference]: With dead ends: 12400 [2019-12-18 14:25:13,472 INFO L226 Difference]: Without dead ends: 12400 [2019-12-18 14:25:13,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:25:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2019-12-18 14:25:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 12304. [2019-12-18 14:25:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12304 states. [2019-12-18 14:25:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12304 states to 12304 states and 38107 transitions. [2019-12-18 14:25:13,881 INFO L78 Accepts]: Start accepts. Automaton has 12304 states and 38107 transitions. Word has length 25 [2019-12-18 14:25:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:13,881 INFO L462 AbstractCegarLoop]: Abstraction has 12304 states and 38107 transitions. [2019-12-18 14:25:13,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:25:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 12304 states and 38107 transitions. [2019-12-18 14:25:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:25:13,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:13,899 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] [2019-12-18 14:25:13,899 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:13,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:13,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1598965693, now seen corresponding path program 1 times [2019-12-18 14:25:13,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:13,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747129661] [2019-12-18 14:25:13,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:13,981 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-18 14:25:13,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747129661] [2019-12-18 14:25:13,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:13,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:25:13,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437756477] [2019-12-18 14:25:13,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:25:13,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:13,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:25:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:25:13,984 INFO L87 Difference]: Start difference. First operand 12304 states and 38107 transitions. Second operand 3 states. [2019-12-18 14:25:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:14,042 INFO L93 Difference]: Finished difference Result 12303 states and 38105 transitions. [2019-12-18 14:25:14,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:25:14,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 14:25:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:14,069 INFO L225 Difference]: With dead ends: 12303 [2019-12-18 14:25:14,069 INFO L226 Difference]: Without dead ends: 12303 [2019-12-18 14:25:14,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-18 14:25:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12303 states. [2019-12-18 14:25:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12303 to 12303. [2019-12-18 14:25:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-12-18 14:25:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 38105 transitions. [2019-12-18 14:25:14,334 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 38105 transitions. Word has length 39 [2019-12-18 14:25:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:14,336 INFO L462 AbstractCegarLoop]: Abstraction has 12303 states and 38105 transitions. [2019-12-18 14:25:14,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 38105 transitions. [2019-12-18 14:25:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:25:14,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:14,361 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-18 14:25:14,361 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:14,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:14,362 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-18 14:25:14,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:14,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354287633] [2019-12-18 14:25:14,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:14,433 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-18 14:25:14,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354287633] [2019-12-18 14:25:14,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:14,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:25:14,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066598309] [2019-12-18 14:25:14,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:25:14,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:14,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:25:14,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:25:14,435 INFO L87 Difference]: Start difference. First operand 12303 states and 38105 transitions. Second operand 5 states. [2019-12-18 14:25:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:14,500 INFO L93 Difference]: Finished difference Result 11071 states and 34927 transitions. [2019-12-18 14:25:14,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:25:14,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:25:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:14,516 INFO L225 Difference]: With dead ends: 11071 [2019-12-18 14:25:14,517 INFO L226 Difference]: Without dead ends: 11071 [2019-12-18 14:25:14,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:25:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11071 states. [2019-12-18 14:25:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11071 to 10759. [2019-12-18 14:25:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10759 states. [2019-12-18 14:25:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10759 states to 10759 states and 34051 transitions. [2019-12-18 14:25:14,677 INFO L78 Accepts]: Start accepts. Automaton has 10759 states and 34051 transitions. Word has length 40 [2019-12-18 14:25:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:14,677 INFO L462 AbstractCegarLoop]: Abstraction has 10759 states and 34051 transitions. [2019-12-18 14:25:14,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:25:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10759 states and 34051 transitions. [2019-12-18 14:25:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:14,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:14,692 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] [2019-12-18 14:25:14,692 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:14,693 INFO L82 PathProgramCache]: Analyzing trace with hash 166042611, now seen corresponding path program 1 times [2019-12-18 14:25:14,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:14,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075763040] [2019-12-18 14:25:14,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:14,757 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-18 14:25:14,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075763040] [2019-12-18 14:25:14,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:14,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:25:14,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836070282] [2019-12-18 14:25:14,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:25:14,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:14,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:25:14,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:25:14,759 INFO L87 Difference]: Start difference. First operand 10759 states and 34051 transitions. Second operand 3 states. [2019-12-18 14:25:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:14,849 INFO L93 Difference]: Finished difference Result 14663 states and 46512 transitions. [2019-12-18 14:25:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:25:14,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 14:25:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:14,879 INFO L225 Difference]: With dead ends: 14663 [2019-12-18 14:25:14,880 INFO L226 Difference]: Without dead ends: 14663 [2019-12-18 14:25:14,880 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-18 14:25:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14663 states. [2019-12-18 14:25:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14663 to 12155. [2019-12-18 14:25:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12155 states. [2019-12-18 14:25:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12155 states to 12155 states and 39013 transitions. [2019-12-18 14:25:15,097 INFO L78 Accepts]: Start accepts. Automaton has 12155 states and 39013 transitions. Word has length 54 [2019-12-18 14:25:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:15,097 INFO L462 AbstractCegarLoop]: Abstraction has 12155 states and 39013 transitions. [2019-12-18 14:25:15,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 12155 states and 39013 transitions. [2019-12-18 14:25:15,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:15,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:15,117 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] [2019-12-18 14:25:15,117 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:15,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:15,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2131568022, now seen corresponding path program 1 times [2019-12-18 14:25:15,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:15,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634157971] [2019-12-18 14:25:15,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:15,191 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-18 14:25:15,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634157971] [2019-12-18 14:25:15,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:15,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:25:15,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748870252] [2019-12-18 14:25:15,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:25:15,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:15,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:25:15,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:25:15,193 INFO L87 Difference]: Start difference. First operand 12155 states and 39013 transitions. Second operand 4 states. [2019-12-18 14:25:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:15,295 INFO L93 Difference]: Finished difference Result 23229 states and 74774 transitions. [2019-12-18 14:25:15,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:25:15,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 14:25:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:15,319 INFO L225 Difference]: With dead ends: 23229 [2019-12-18 14:25:15,319 INFO L226 Difference]: Without dead ends: 11383 [2019-12-18 14:25:15,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-18 14:25:15,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11383 states. [2019-12-18 14:25:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11383 to 11383. [2019-12-18 14:25:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11383 states. [2019-12-18 14:25:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11383 states to 11383 states and 36651 transitions. [2019-12-18 14:25:15,574 INFO L78 Accepts]: Start accepts. Automaton has 11383 states and 36651 transitions. Word has length 54 [2019-12-18 14:25:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:15,574 INFO L462 AbstractCegarLoop]: Abstraction has 11383 states and 36651 transitions. [2019-12-18 14:25:15,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:25:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 11383 states and 36651 transitions. [2019-12-18 14:25:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:15,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:15,589 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] [2019-12-18 14:25:15,589 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:15,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:15,589 INFO L82 PathProgramCache]: Analyzing trace with hash 794798576, now seen corresponding path program 2 times [2019-12-18 14:25:15,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:15,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277276387] [2019-12-18 14:25:15,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:15,651 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-18 14:25:15,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277276387] [2019-12-18 14:25:15,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:15,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:25:15,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157482728] [2019-12-18 14:25:15,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:25:15,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:15,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:25:15,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:25:15,653 INFO L87 Difference]: Start difference. First operand 11383 states and 36651 transitions. Second operand 4 states. [2019-12-18 14:25:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:15,849 INFO L93 Difference]: Finished difference Result 29018 states and 95263 transitions. [2019-12-18 14:25:15,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:25:15,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 14:25:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:15,858 INFO L225 Difference]: With dead ends: 29018 [2019-12-18 14:25:15,859 INFO L226 Difference]: Without dead ends: 5072 [2019-12-18 14:25:15,859 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-18 14:25:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2019-12-18 14:25:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5072. [2019-12-18 14:25:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5072 states. [2019-12-18 14:25:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5072 states to 5072 states and 17135 transitions. [2019-12-18 14:25:15,940 INFO L78 Accepts]: Start accepts. Automaton has 5072 states and 17135 transitions. Word has length 54 [2019-12-18 14:25:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:15,940 INFO L462 AbstractCegarLoop]: Abstraction has 5072 states and 17135 transitions. [2019-12-18 14:25:15,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:25:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 17135 transitions. [2019-12-18 14:25:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:15,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:15,947 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] [2019-12-18 14:25:15,947 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:15,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash 370181420, now seen corresponding path program 3 times [2019-12-18 14:25:15,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:15,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061570719] [2019-12-18 14:25:15,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:16,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-18 14:25:16,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061570719] [2019-12-18 14:25:16,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:16,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:25:16,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120368758] [2019-12-18 14:25:16,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:25:16,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:16,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:25:16,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:25:16,034 INFO L87 Difference]: Start difference. First operand 5072 states and 17135 transitions. Second operand 7 states. [2019-12-18 14:25:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:16,315 INFO L93 Difference]: Finished difference Result 9562 states and 31657 transitions. [2019-12-18 14:25:16,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:25:16,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:25:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:16,335 INFO L225 Difference]: With dead ends: 9562 [2019-12-18 14:25:16,335 INFO L226 Difference]: Without dead ends: 6984 [2019-12-18 14:25:16,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:25:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6984 states. [2019-12-18 14:25:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6984 to 6241. [2019-12-18 14:25:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2019-12-18 14:25:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 21010 transitions. [2019-12-18 14:25:16,504 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 21010 transitions. Word has length 54 [2019-12-18 14:25:16,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:16,505 INFO L462 AbstractCegarLoop]: Abstraction has 6241 states and 21010 transitions. [2019-12-18 14:25:16,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:25:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 21010 transitions. [2019-12-18 14:25:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:16,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:16,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] [2019-12-18 14:25:16,516 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1876082156, now seen corresponding path program 4 times [2019-12-18 14:25:16,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:16,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728682325] [2019-12-18 14:25:16,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:16,604 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-18 14:25:16,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728682325] [2019-12-18 14:25:16,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:16,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:25:16,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217976020] [2019-12-18 14:25:16,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:25:16,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:16,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:25:16,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:25:16,606 INFO L87 Difference]: Start difference. First operand 6241 states and 21010 transitions. Second operand 7 states. [2019-12-18 14:25:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:16,855 INFO L93 Difference]: Finished difference Result 11586 states and 38057 transitions. [2019-12-18 14:25:16,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:25:16,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:25:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:16,872 INFO L225 Difference]: With dead ends: 11586 [2019-12-18 14:25:16,872 INFO L226 Difference]: Without dead ends: 8529 [2019-12-18 14:25:16,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:25:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8529 states. [2019-12-18 14:25:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8529 to 7599. [2019-12-18 14:25:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7599 states. [2019-12-18 14:25:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7599 states to 7599 states and 25347 transitions. [2019-12-18 14:25:17,068 INFO L78 Accepts]: Start accepts. Automaton has 7599 states and 25347 transitions. Word has length 54 [2019-12-18 14:25:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:17,069 INFO L462 AbstractCegarLoop]: Abstraction has 7599 states and 25347 transitions. [2019-12-18 14:25:17,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:25:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 7599 states and 25347 transitions. [2019-12-18 14:25:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:17,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:17,084 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] [2019-12-18 14:25:17,084 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:17,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1222512202, now seen corresponding path program 5 times [2019-12-18 14:25:17,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:17,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670564242] [2019-12-18 14:25:17,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:17,165 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-18 14:25:17,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670564242] [2019-12-18 14:25:17,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:17,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:25:17,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679618521] [2019-12-18 14:25:17,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:25:17,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:17,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:25:17,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:25:17,167 INFO L87 Difference]: Start difference. First operand 7599 states and 25347 transitions. Second operand 7 states. [2019-12-18 14:25:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:17,481 INFO L93 Difference]: Finished difference Result 16599 states and 53966 transitions. [2019-12-18 14:25:17,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:25:17,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 14:25:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:17,504 INFO L225 Difference]: With dead ends: 16599 [2019-12-18 14:25:17,504 INFO L226 Difference]: Without dead ends: 14168 [2019-12-18 14:25:17,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:25:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14168 states. [2019-12-18 14:25:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14168 to 7739. [2019-12-18 14:25:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7739 states. [2019-12-18 14:25:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7739 states to 7739 states and 25816 transitions. [2019-12-18 14:25:17,669 INFO L78 Accepts]: Start accepts. Automaton has 7739 states and 25816 transitions. Word has length 54 [2019-12-18 14:25:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:17,669 INFO L462 AbstractCegarLoop]: Abstraction has 7739 states and 25816 transitions. [2019-12-18 14:25:17,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:25:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 7739 states and 25816 transitions. [2019-12-18 14:25:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 14:25:17,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:17,678 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] [2019-12-18 14:25:17,679 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:17,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1952183562, now seen corresponding path program 6 times [2019-12-18 14:25:17,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:17,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473305856] [2019-12-18 14:25:17,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:17,764 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-18 14:25:17,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473305856] [2019-12-18 14:25:17,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:17,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:25:17,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960366103] [2019-12-18 14:25:17,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:25:17,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:17,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:25:17,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:25:17,766 INFO L87 Difference]: Start difference. First operand 7739 states and 25816 transitions. Second operand 3 states. [2019-12-18 14:25:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:17,807 INFO L93 Difference]: Finished difference Result 6206 states and 20080 transitions. [2019-12-18 14:25:17,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:25:17,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 14:25:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:17,821 INFO L225 Difference]: With dead ends: 6206 [2019-12-18 14:25:17,821 INFO L226 Difference]: Without dead ends: 6206 [2019-12-18 14:25:17,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-18 14:25:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2019-12-18 14:25:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 5926. [2019-12-18 14:25:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-18 14:25:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19190 transitions. [2019-12-18 14:25:17,953 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19190 transitions. Word has length 54 [2019-12-18 14:25:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:17,953 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19190 transitions. [2019-12-18 14:25:17,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19190 transitions. [2019-12-18 14:25:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:25:17,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:17,962 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-18 14:25:17,962 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:17,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1490833915, now seen corresponding path program 1 times [2019-12-18 14:25:17,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:17,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75103987] [2019-12-18 14:25:17,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:18,050 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-18 14:25:18,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75103987] [2019-12-18 14:25:18,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:18,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:25:18,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170313405] [2019-12-18 14:25:18,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:25:18,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:18,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:25:18,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:25:18,052 INFO L87 Difference]: Start difference. First operand 5926 states and 19190 transitions. Second operand 3 states. [2019-12-18 14:25:18,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:18,083 INFO L93 Difference]: Finished difference Result 5926 states and 19188 transitions. [2019-12-18 14:25:18,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:25:18,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 14:25:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:18,093 INFO L225 Difference]: With dead ends: 5926 [2019-12-18 14:25:18,093 INFO L226 Difference]: Without dead ends: 5926 [2019-12-18 14:25:18,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-18 14:25:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2019-12-18 14:25:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2019-12-18 14:25:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-18 14:25:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19188 transitions. [2019-12-18 14:25:18,250 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19188 transitions. Word has length 55 [2019-12-18 14:25:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:18,251 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19188 transitions. [2019-12-18 14:25:18,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:25:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19188 transitions. [2019-12-18 14:25:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:18,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:18,259 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-18 14:25:18,259 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:18,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 1 times [2019-12-18 14:25:18,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:18,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674430564] [2019-12-18 14:25:18,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:18,558 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-18 14:25:18,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674430564] [2019-12-18 14:25:18,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:18,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:25:18,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013563016] [2019-12-18 14:25:18,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:25:18,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:18,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:25:18,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:25:18,560 INFO L87 Difference]: Start difference. First operand 5926 states and 19188 transitions. Second operand 12 states. [2019-12-18 14:25:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:21,162 INFO L93 Difference]: Finished difference Result 13014 states and 41287 transitions. [2019-12-18 14:25:21,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 14:25:21,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 14:25:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:21,176 INFO L225 Difference]: With dead ends: 13014 [2019-12-18 14:25:21,176 INFO L226 Difference]: Without dead ends: 8276 [2019-12-18 14:25:21,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2019-12-18 14:25:21,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8276 states. [2019-12-18 14:25:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8276 to 6482. [2019-12-18 14:25:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6482 states. [2019-12-18 14:25:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 20542 transitions. [2019-12-18 14:25:21,292 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 20542 transitions. Word has length 56 [2019-12-18 14:25:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:21,292 INFO L462 AbstractCegarLoop]: Abstraction has 6482 states and 20542 transitions. [2019-12-18 14:25:21,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:25:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 20542 transitions. [2019-12-18 14:25:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:21,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:21,300 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-18 14:25:21,300 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash 290005151, now seen corresponding path program 2 times [2019-12-18 14:25:21,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:21,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527679105] [2019-12-18 14:25:21,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:21,647 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-18 14:25:21,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527679105] [2019-12-18 14:25:21,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:21,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:25:21,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892700477] [2019-12-18 14:25:21,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:25:21,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:21,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:25:21,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:25:21,652 INFO L87 Difference]: Start difference. First operand 6482 states and 20542 transitions. Second operand 11 states. [2019-12-18 14:25:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:22,505 INFO L93 Difference]: Finished difference Result 9112 states and 28803 transitions. [2019-12-18 14:25:22,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 14:25:22,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:25:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:22,521 INFO L225 Difference]: With dead ends: 9112 [2019-12-18 14:25:22,521 INFO L226 Difference]: Without dead ends: 8802 [2019-12-18 14:25:22,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:25:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8802 states. [2019-12-18 14:25:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8802 to 8126. [2019-12-18 14:25:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8126 states. [2019-12-18 14:25:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 25897 transitions. [2019-12-18 14:25:22,656 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 25897 transitions. Word has length 56 [2019-12-18 14:25:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:22,657 INFO L462 AbstractCegarLoop]: Abstraction has 8126 states and 25897 transitions. [2019-12-18 14:25:22,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:25:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 25897 transitions. [2019-12-18 14:25:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:22,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:22,666 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-18 14:25:22,666 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:22,667 INFO L82 PathProgramCache]: Analyzing trace with hash 105084255, now seen corresponding path program 3 times [2019-12-18 14:25:22,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:22,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101986199] [2019-12-18 14:25:22,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:23,038 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-18 14:25:23,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101986199] [2019-12-18 14:25:23,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:23,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:25:23,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262706062] [2019-12-18 14:25:23,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:25:23,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:23,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:25:23,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:25:23,041 INFO L87 Difference]: Start difference. First operand 8126 states and 25897 transitions. Second operand 11 states. [2019-12-18 14:25:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:24,105 INFO L93 Difference]: Finished difference Result 9158 states and 28617 transitions. [2019-12-18 14:25:24,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:25:24,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:25:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:24,119 INFO L225 Difference]: With dead ends: 9158 [2019-12-18 14:25:24,120 INFO L226 Difference]: Without dead ends: 6898 [2019-12-18 14:25:24,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:25:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2019-12-18 14:25:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 5992. [2019-12-18 14:25:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5992 states. [2019-12-18 14:25:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5992 states to 5992 states and 19034 transitions. [2019-12-18 14:25:24,337 INFO L78 Accepts]: Start accepts. Automaton has 5992 states and 19034 transitions. Word has length 56 [2019-12-18 14:25:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:24,337 INFO L462 AbstractCegarLoop]: Abstraction has 5992 states and 19034 transitions. [2019-12-18 14:25:24,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:25:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5992 states and 19034 transitions. [2019-12-18 14:25:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:24,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:24,351 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-18 14:25:24,352 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash 208159905, now seen corresponding path program 4 times [2019-12-18 14:25:24,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:24,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235912246] [2019-12-18 14:25:24,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:25:24,772 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-18 14:25:24,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235912246] [2019-12-18 14:25:24,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:25:24,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:25:24,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167132845] [2019-12-18 14:25:24,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:25:24,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:25:24,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:25:24,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:25:24,776 INFO L87 Difference]: Start difference. First operand 5992 states and 19034 transitions. Second operand 13 states. [2019-12-18 14:25:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:25:27,279 INFO L93 Difference]: Finished difference Result 8181 states and 24843 transitions. [2019-12-18 14:25:27,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 14:25:27,280 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 14:25:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:25:27,293 INFO L225 Difference]: With dead ends: 8181 [2019-12-18 14:25:27,293 INFO L226 Difference]: Without dead ends: 7642 [2019-12-18 14:25:27,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2019-12-18 14:25:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7642 states. [2019-12-18 14:25:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7642 to 5790. [2019-12-18 14:25:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5790 states. [2019-12-18 14:25:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5790 states to 5790 states and 18449 transitions. [2019-12-18 14:25:27,397 INFO L78 Accepts]: Start accepts. Automaton has 5790 states and 18449 transitions. Word has length 56 [2019-12-18 14:25:27,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:25:27,397 INFO L462 AbstractCegarLoop]: Abstraction has 5790 states and 18449 transitions. [2019-12-18 14:25:27,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:25:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 5790 states and 18449 transitions. [2019-12-18 14:25:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:25:27,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:25:27,404 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-18 14:25:27,404 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:25:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:25:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 5 times [2019-12-18 14:25:27,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:25:27,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73678971] [2019-12-18 14:25:27,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:25:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:25:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:25:27,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:25:27,519 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:25:27,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1834~0.base_39| 1)) (= 0 v_~__unbuffered_p0_EAX~0_82) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1834~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1834~0.base_39|) |v_ULTIMATE.start_main_~#t1834~0.offset_25| 0)) |v_#memory_int_21|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1834~0.base_39| 4)) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= v_~main$tmp_guard1~0_61 0) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1834~0.base_39|) 0) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_ULTIMATE.start_main_~#t1834~0.offset_25|) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1834~0.base_39|) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_~#t1835~0.offset=|v_ULTIMATE.start_main_~#t1835~0.offset_25|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1835~0.base=|v_ULTIMATE.start_main_~#t1835~0.base_37|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ULTIMATE.start_main_~#t1834~0.base=|v_ULTIMATE.start_main_~#t1834~0.base_39|, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ULTIMATE.start_main_~#t1836~0.offset=|v_ULTIMATE.start_main_~#t1836~0.offset_16|, ~x~0=v_~x~0_186, ULTIMATE.start_main_~#t1834~0.offset=|v_ULTIMATE.start_main_~#t1834~0.offset_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ULTIMATE.start_main_~#t1836~0.base=|v_ULTIMATE.start_main_~#t1836~0.base_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t1834~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t1836~0.base, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1835~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1835~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1834~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1836~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:25:27,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1835~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1835~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1835~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1835~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1835~0.base_10|) |v_ULTIMATE.start_main_~#t1835~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1835~0.base_10| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1835~0.base_10| 4)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1835~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1835~0.offset=|v_ULTIMATE.start_main_~#t1835~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1835~0.base=|v_ULTIMATE.start_main_~#t1835~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1835~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1835~0.base] because there is no mapped edge [2019-12-18 14:25:27,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t1836~0.offset_9| 0) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1836~0.base_10|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1836~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1836~0.base_10|) |v_ULTIMATE.start_main_~#t1836~0.offset_9| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1836~0.base_10| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1836~0.base_10| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1836~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1836~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1836~0.base=|v_ULTIMATE.start_main_~#t1836~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1836~0.offset=|v_ULTIMATE.start_main_~#t1836~0.offset_9|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1836~0.base, #length, ULTIMATE.start_main_~#t1836~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 14:25:27,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 14:25:27,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In513854744 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In513854744 256) 0))) (or (and (= ~x~0_In513854744 |P2Thread1of1ForFork1_#t~ite32_Out513854744|) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In513854744 |P2Thread1of1ForFork1_#t~ite32_Out513854744|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In513854744, ~x$w_buff1_used~0=~x$w_buff1_used~0_In513854744, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In513854744, ~x~0=~x~0_In513854744} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out513854744|, ~x$w_buff1~0=~x$w_buff1~0_In513854744, ~x$w_buff1_used~0=~x$w_buff1_used~0_In513854744, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In513854744, ~x~0=~x~0_In513854744} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:25:27,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1942088722 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1942088722 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1942088722| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1942088722| ~x$w_buff0_used~0_In-1942088722) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1942088722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1942088722} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1942088722, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1942088722|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1942088722} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:25:27,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:25:27,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1868938341 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1868938341 256) 0))) (or (and (= ~x$w_buff0_used~0_In1868938341 |P2Thread1of1ForFork1_#t~ite34_Out1868938341|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out1868938341| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1868938341, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1868938341} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1868938341|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1868938341, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1868938341} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:25:27,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In321849368 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In321849368 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In321849368 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In321849368 256)))) (or (and (= ~x$w_buff1_used~0_In321849368 |P1Thread1of1ForFork0_#t~ite29_Out321849368|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out321849368|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In321849368, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In321849368, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In321849368, ~x$w_buff0_used~0=~x$w_buff0_used~0_In321849368} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In321849368, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In321849368, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In321849368, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out321849368|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In321849368} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:25:27,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1927480661 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1927480661 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1927480661 ~x$r_buff0_thd2~0_Out-1927480661)) (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-1927480661) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1927480661, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1927480661} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1927480661|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1927480661, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1927480661} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:25:27,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In171933842 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In171933842 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In171933842 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In171933842 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out171933842|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In171933842 |P1Thread1of1ForFork0_#t~ite31_Out171933842|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In171933842, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In171933842, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In171933842, ~x$w_buff0_used~0=~x$w_buff0_used~0_In171933842} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out171933842|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In171933842, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In171933842, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In171933842, ~x$w_buff0_used~0=~x$w_buff0_used~0_In171933842} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:25:27,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_46|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_45|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:25:27,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-4840692 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-4840692 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-4840692 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-4840692 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-4840692| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-4840692 |P2Thread1of1ForFork1_#t~ite35_Out-4840692|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-4840692, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-4840692, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-4840692, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-4840692} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-4840692|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-4840692, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-4840692, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-4840692, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-4840692} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:25:27,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-725332033 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-725332033 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-725332033| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-725332033| ~x$r_buff0_thd3~0_In-725332033)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-725332033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-725332033} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-725332033|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-725332033, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-725332033} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:25:27,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1080297408 256) 0))) (or (and (= ~x$w_buff1~0_In-1080297408 |P0Thread1of1ForFork2_#t~ite11_Out-1080297408|) (= |P0Thread1of1ForFork2_#t~ite12_Out-1080297408| |P0Thread1of1ForFork2_#t~ite11_Out-1080297408|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1080297408 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-1080297408 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1080297408 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1080297408 256)))))) (and (= |P0Thread1of1ForFork2_#t~ite11_In-1080297408| |P0Thread1of1ForFork2_#t~ite11_Out-1080297408|) (not .cse0) (= ~x$w_buff1~0_In-1080297408 |P0Thread1of1ForFork2_#t~ite12_Out-1080297408|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1080297408, ~x$w_buff1~0=~x$w_buff1~0_In-1080297408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1080297408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1080297408, ~weak$$choice2~0=~weak$$choice2~0_In-1080297408, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1080297408|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1080297408} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1080297408, ~x$w_buff1~0=~x$w_buff1~0_In-1080297408, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1080297408, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1080297408, ~weak$$choice2~0=~weak$$choice2~0_In-1080297408, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1080297408|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1080297408|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1080297408} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 14:25:27,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2000778018 256) 0))) (or (and (= ~x$w_buff0_used~0_In2000778018 |P0Thread1of1ForFork2_#t~ite15_Out2000778018|) (= |P0Thread1of1ForFork2_#t~ite14_In2000778018| |P0Thread1of1ForFork2_#t~ite14_Out2000778018|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite14_Out2000778018| |P0Thread1of1ForFork2_#t~ite15_Out2000778018|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In2000778018 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In2000778018 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In2000778018 256) 0)) (= (mod ~x$w_buff0_used~0_In2000778018 256) 0))) (= ~x$w_buff0_used~0_In2000778018 |P0Thread1of1ForFork2_#t~ite14_Out2000778018|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2000778018, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2000778018, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2000778018, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In2000778018|, ~weak$$choice2~0=~weak$$choice2~0_In2000778018, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2000778018} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2000778018, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2000778018, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out2000778018|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2000778018, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out2000778018|, ~weak$$choice2~0=~weak$$choice2~0_In2000778018, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2000778018} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 14:25:27,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:25:27,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1101009326 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out1101009326| |P0Thread1of1ForFork2_#t~ite23_Out1101009326|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1101009326 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In1101009326 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In1101009326 256) 0) (and .cse0 (= (mod ~x$w_buff1_used~0_In1101009326 256) 0)))) (= ~x$r_buff1_thd1~0_In1101009326 |P0Thread1of1ForFork2_#t~ite23_Out1101009326|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite24_Out1101009326| ~x$r_buff1_thd1~0_In1101009326) (= |P0Thread1of1ForFork2_#t~ite23_In1101009326| |P0Thread1of1ForFork2_#t~ite23_Out1101009326|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1101009326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1101009326, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1101009326, ~weak$$choice2~0=~weak$$choice2~0_In1101009326, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1101009326|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1101009326} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1101009326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1101009326, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1101009326, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1101009326|, ~weak$$choice2~0=~weak$$choice2~0_In1101009326, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1101009326|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1101009326} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 14:25:27,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:25:27,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In-1670500374 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1670500374 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1670500374 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1670500374 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-1670500374| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-1670500374| ~x$r_buff1_thd3~0_In-1670500374) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1670500374, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1670500374, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1670500374, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1670500374} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1670500374|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1670500374, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1670500374, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1670500374, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1670500374} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:25:27,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_32|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 14:25:27,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_35) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:25:27,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out155993502| |ULTIMATE.start_main_#t~ite41_Out155993502|)) (.cse1 (= (mod ~x$w_buff1_used~0_In155993502 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In155993502 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out155993502| ~x$w_buff1~0_In155993502) .cse0 (not .cse1) (not .cse2)) (and (= ~x~0_In155993502 |ULTIMATE.start_main_#t~ite41_Out155993502|) .cse0 (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In155993502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In155993502, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In155993502, ~x~0=~x~0_In155993502} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out155993502|, ~x$w_buff1~0=~x$w_buff1~0_In155993502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In155993502, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In155993502, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out155993502|, ~x~0=~x~0_In155993502} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:25:27,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2131592288 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-2131592288 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2131592288 |ULTIMATE.start_main_#t~ite43_Out-2131592288|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-2131592288|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2131592288, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131592288} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2131592288, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2131592288|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131592288} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:25:27,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1260136359 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1260136359 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1260136359 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1260136359 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1260136359| 0)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1260136359 |ULTIMATE.start_main_#t~ite44_Out-1260136359|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1260136359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1260136359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1260136359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1260136359} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1260136359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1260136359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1260136359, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1260136359|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1260136359} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:25:27,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In486399149 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In486399149 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In486399149 |ULTIMATE.start_main_#t~ite45_Out486399149|)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out486399149|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In486399149, ~x$w_buff0_used~0=~x$w_buff0_used~0_In486399149} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In486399149, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out486399149|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In486399149} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:25:27,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-967279384 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-967279384 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-967279384 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-967279384 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In-967279384 |ULTIMATE.start_main_#t~ite46_Out-967279384|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-967279384|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-967279384, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-967279384, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-967279384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-967279384} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-967279384, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-967279384|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-967279384, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-967279384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-967279384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 14:25:27,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~main$tmp_guard1~0_24 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:25:27,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:25:27 BasicIcfg [2019-12-18 14:25:27,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:25:27,656 INFO L168 Benchmark]: Toolchain (without parser) took 53289.48 ms. Allocated memory was 143.7 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 98.5 MB in the beginning and 931.2 MB in the end (delta: -832.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 14:25:27,656 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.7 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:25:27,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.33 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.3 MB in the beginning and 154.9 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:27,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.27 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:27,659 INFO L168 Benchmark]: Boogie Preprocessor took 41.63 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:27,660 INFO L168 Benchmark]: RCFGBuilder took 781.37 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 103.8 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:25:27,663 INFO L168 Benchmark]: TraceAbstraction took 51601.62 ms. Allocated memory was 201.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 103.1 MB in the beginning and 931.2 MB in the end (delta: -828.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 14:25:27,672 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 143.7 MB. Free memory was 118.8 MB in the beginning and 118.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.33 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.3 MB in the beginning and 154.9 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.27 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.63 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 781.37 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 103.8 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51601.62 ms. Allocated memory was 201.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 103.1 MB in the beginning and 931.2 MB in the end (delta: -828.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1834, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1835, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1836, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 51.2s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3419 SDtfs, 4667 SDslu, 11712 SDs, 0 SdLazy, 7014 SolverSat, 225 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80448occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 69005 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 221376 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...