/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:54:12,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:54:12,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:54:13,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:54:13,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:54:13,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:54:13,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:54:13,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:54:13,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:54:13,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:54:13,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:54:13,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:54:13,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:54:13,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:54:13,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:54:13,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:54:13,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:54:13,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:54:13,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:54:13,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:54:13,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:54:13,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:54:13,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:54:13,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:54:13,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:54:13,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:54:13,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:54:13,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:54:13,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:54:13,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:54:13,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:54:13,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:54:13,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:54:13,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:54:13,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:54:13,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:54:13,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:54:13,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:54:13,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:54:13,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:54:13,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:54:13,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:54:13,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:54:13,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:54:13,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:54:13,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:54:13,067 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:54:13,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:54:13,067 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:54:13,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:54:13,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:54:13,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:54:13,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:54:13,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:54:13,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:54:13,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:54:13,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:54:13,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:54:13,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:54:13,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:54:13,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:54:13,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:54:13,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:54:13,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:54:13,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:54:13,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:54:13,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:54:13,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:54:13,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:54:13,073 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:54:13,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:54:13,073 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:54:13,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:54:13,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:54:13,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:54:13,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:54:13,372 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:54:13,372 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:54:13,373 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i [2019-12-27 15:54:13,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d396de22/fe307adcec9e4535847ff48af70a5112/FLAGa012aa899 [2019-12-27 15:54:13,979 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:54:13,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i [2019-12-27 15:54:14,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d396de22/fe307adcec9e4535847ff48af70a5112/FLAGa012aa899 [2019-12-27 15:54:14,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d396de22/fe307adcec9e4535847ff48af70a5112 [2019-12-27 15:54:14,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:54:14,268 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:54:14,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:54:14,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:54:14,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:54:14,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:54:14" (1/1) ... [2019-12-27 15:54:14,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1b0b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:14, skipping insertion in model container [2019-12-27 15:54:14,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:54:14" (1/1) ... [2019-12-27 15:54:14,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:54:14,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:54:14,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:54:14,875 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:54:14,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:54:15,062 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:54:15,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15 WrapperNode [2019-12-27 15:54:15,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:54:15,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:54:15,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:54:15,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:54:15,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15" (1/1) ... [2019-12-27 15:54:15,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15" (1/1) ... [2019-12-27 15:54:15,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:54:15,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:54:15,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:54:15,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:54:15,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15" (1/1) ... [2019-12-27 15:54:15,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15" (1/1) ... [2019-12-27 15:54:15,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15" (1/1) ... [2019-12-27 15:54:15,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15" (1/1) ... [2019-12-27 15:54:15,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15" (1/1) ... [2019-12-27 15:54:15,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15" (1/1) ... [2019-12-27 15:54:15,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15" (1/1) ... [2019-12-27 15:54:15,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:54:15,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:54:15,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:54:15,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:54:15,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15" (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-27 15:54:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:54:15,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:54:15,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:54:15,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:54:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:54:15,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:54:15,276 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:54:15,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:54:15,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:54:15,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:54:15,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:54:15,280 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:54:16,197 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:54:16,197 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:54:16,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:54:16 BoogieIcfgContainer [2019-12-27 15:54:16,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:54:16,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:54:16,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:54:16,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:54:16,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:54:14" (1/3) ... [2019-12-27 15:54:16,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b51418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:54:16, skipping insertion in model container [2019-12-27 15:54:16,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:54:15" (2/3) ... [2019-12-27 15:54:16,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b51418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:54:16, skipping insertion in model container [2019-12-27 15:54:16,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:54:16" (3/3) ... [2019-12-27 15:54:16,207 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt.i [2019-12-27 15:54:16,217 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:54:16,218 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:54:16,225 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:54:16,226 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:54:16,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,272 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,332 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,332 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,333 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,333 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,333 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,361 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,362 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,371 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,373 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:54:16,390 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 15:54:16,411 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:54:16,411 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:54:16,411 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:54:16,411 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:54:16,411 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:54:16,411 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:54:16,412 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:54:16,412 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:54:16,428 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-27 15:54:16,430 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 15:54:16,549 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 15:54:16,549 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:54:16,567 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 15:54:16,599 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-27 15:54:16,659 INFO L132 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-27 15:54:16,660 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:54:16,674 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/167 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 15:54:16,699 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 15:54:16,700 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:54:21,370 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 15:54:21,732 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 15:54:21,837 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 15:54:21,889 INFO L206 etLargeBlockEncoding]: Checked pairs total: 122314 [2019-12-27 15:54:21,889 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 15:54:21,893 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 126 transitions [2019-12-27 15:54:23,298 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24222 states. [2019-12-27 15:54:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 24222 states. [2019-12-27 15:54:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 15:54:23,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:23,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 15:54:23,309 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash 958600405, now seen corresponding path program 1 times [2019-12-27 15:54:23,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:23,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721157339] [2019-12-27 15:54:23,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:23,615 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-27 15:54:23,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721157339] [2019-12-27 15:54:23,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:23,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:54:23,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1018133985] [2019-12-27 15:54:23,621 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:23,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:23,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 15:54:23,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:23,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:23,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:54:23,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:23,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:54:23,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:23,663 INFO L87 Difference]: Start difference. First operand 24222 states. Second operand 3 states. [2019-12-27 15:54:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:24,101 INFO L93 Difference]: Finished difference Result 24022 states and 85786 transitions. [2019-12-27 15:54:24,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:24,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 15:54:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:24,326 INFO L225 Difference]: With dead ends: 24022 [2019-12-27 15:54:24,326 INFO L226 Difference]: Without dead ends: 22482 [2019-12-27 15:54:24,328 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-27 15:54:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22482 states. [2019-12-27 15:54:26,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22482 to 22482. [2019-12-27 15:54:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22482 states. [2019-12-27 15:54:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22482 states to 22482 states and 80227 transitions. [2019-12-27 15:54:26,523 INFO L78 Accepts]: Start accepts. Automaton has 22482 states and 80227 transitions. Word has length 5 [2019-12-27 15:54:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:26,523 INFO L462 AbstractCegarLoop]: Abstraction has 22482 states and 80227 transitions. [2019-12-27 15:54:26,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:54:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 22482 states and 80227 transitions. [2019-12-27 15:54:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:54:26,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:26,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:26,527 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:26,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:26,528 INFO L82 PathProgramCache]: Analyzing trace with hash -131274802, now seen corresponding path program 1 times [2019-12-27 15:54:26,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:26,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326769433] [2019-12-27 15:54:26,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:26,653 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-27 15:54:26,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326769433] [2019-12-27 15:54:26,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:26,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:54:26,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497488913] [2019-12-27 15:54:26,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:26,658 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:26,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:54:26,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:26,666 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:26,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:54:26,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:26,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:54:26,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:54:26,672 INFO L87 Difference]: Start difference. First operand 22482 states and 80227 transitions. Second operand 4 states. [2019-12-27 15:54:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:27,220 INFO L93 Difference]: Finished difference Result 34872 states and 119343 transitions. [2019-12-27 15:54:27,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:54:27,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:54:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:27,368 INFO L225 Difference]: With dead ends: 34872 [2019-12-27 15:54:27,369 INFO L226 Difference]: Without dead ends: 34857 [2019-12-27 15:54:27,370 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-27 15:54:28,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34857 states. [2019-12-27 15:54:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34857 to 33973. [2019-12-27 15:54:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33973 states. [2019-12-27 15:54:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33973 states to 33973 states and 117000 transitions. [2019-12-27 15:54:29,780 INFO L78 Accepts]: Start accepts. Automaton has 33973 states and 117000 transitions. Word has length 11 [2019-12-27 15:54:29,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:29,780 INFO L462 AbstractCegarLoop]: Abstraction has 33973 states and 117000 transitions. [2019-12-27 15:54:29,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:54:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 33973 states and 117000 transitions. [2019-12-27 15:54:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:54:29,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:29,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:29,787 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:29,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:29,787 INFO L82 PathProgramCache]: Analyzing trace with hash -570349916, now seen corresponding path program 1 times [2019-12-27 15:54:29,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:29,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50049391] [2019-12-27 15:54:29,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:29,865 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-27 15:54:29,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50049391] [2019-12-27 15:54:29,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:29,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:54:29,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1140758319] [2019-12-27 15:54:29,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:29,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:29,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 15:54:29,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:29,913 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:54:29,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:29,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:29,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:29,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:29,915 INFO L87 Difference]: Start difference. First operand 33973 states and 117000 transitions. Second operand 5 states. [2019-12-27 15:54:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:30,465 INFO L93 Difference]: Finished difference Result 43608 states and 147815 transitions. [2019-12-27 15:54:30,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:54:30,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 15:54:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:30,623 INFO L225 Difference]: With dead ends: 43608 [2019-12-27 15:54:30,623 INFO L226 Difference]: Without dead ends: 43594 [2019-12-27 15:54:30,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43594 states. [2019-12-27 15:54:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43594 to 39207. [2019-12-27 15:54:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39207 states. [2019-12-27 15:54:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39207 states to 39207 states and 134217 transitions. [2019-12-27 15:54:34,446 INFO L78 Accepts]: Start accepts. Automaton has 39207 states and 134217 transitions. Word has length 14 [2019-12-27 15:54:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:34,447 INFO L462 AbstractCegarLoop]: Abstraction has 39207 states and 134217 transitions. [2019-12-27 15:54:34,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 39207 states and 134217 transitions. [2019-12-27 15:54:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:54:34,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:34,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:34,453 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:34,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:34,453 INFO L82 PathProgramCache]: Analyzing trace with hash -500949887, now seen corresponding path program 1 times [2019-12-27 15:54:34,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:34,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246167499] [2019-12-27 15:54:34,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:34,550 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-27 15:54:34,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246167499] [2019-12-27 15:54:34,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:34,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:34,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [478842462] [2019-12-27 15:54:34,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:34,553 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:34,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 55 transitions. [2019-12-27 15:54:34,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:34,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:54:34,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:34,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:34,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:34,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:34,585 INFO L87 Difference]: Start difference. First operand 39207 states and 134217 transitions. Second operand 5 states. [2019-12-27 15:54:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:34,969 INFO L93 Difference]: Finished difference Result 65918 states and 215197 transitions. [2019-12-27 15:54:34,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:34,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 15:54:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:35,132 INFO L225 Difference]: With dead ends: 65918 [2019-12-27 15:54:35,132 INFO L226 Difference]: Without dead ends: 65918 [2019-12-27 15:54:35,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65918 states. [2019-12-27 15:54:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65918 to 58476. [2019-12-27 15:54:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58476 states. [2019-12-27 15:54:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58476 states to 58476 states and 193967 transitions. [2019-12-27 15:54:37,019 INFO L78 Accepts]: Start accepts. Automaton has 58476 states and 193967 transitions. Word has length 15 [2019-12-27 15:54:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:37,019 INFO L462 AbstractCegarLoop]: Abstraction has 58476 states and 193967 transitions. [2019-12-27 15:54:37,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 58476 states and 193967 transitions. [2019-12-27 15:54:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:54:37,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:37,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:37,025 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:37,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1418364262, now seen corresponding path program 1 times [2019-12-27 15:54:37,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:37,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060051122] [2019-12-27 15:54:37,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:37,114 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-27 15:54:37,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060051122] [2019-12-27 15:54:37,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:37,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:54:37,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1860484300] [2019-12-27 15:54:37,115 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:37,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:37,122 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:54:37,122 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:37,122 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:37,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:54:37,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:37,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:54:37,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:37,123 INFO L87 Difference]: Start difference. First operand 58476 states and 193967 transitions. Second operand 3 states. [2019-12-27 15:54:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:37,337 INFO L93 Difference]: Finished difference Result 55330 states and 183290 transitions. [2019-12-27 15:54:37,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:37,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 15:54:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:37,484 INFO L225 Difference]: With dead ends: 55330 [2019-12-27 15:54:37,484 INFO L226 Difference]: Without dead ends: 55330 [2019-12-27 15:54:37,485 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-27 15:54:37,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55330 states. [2019-12-27 15:54:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55330 to 55330. [2019-12-27 15:54:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55330 states. [2019-12-27 15:54:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55330 states to 55330 states and 183290 transitions. [2019-12-27 15:54:41,755 INFO L78 Accepts]: Start accepts. Automaton has 55330 states and 183290 transitions. Word has length 16 [2019-12-27 15:54:41,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:41,755 INFO L462 AbstractCegarLoop]: Abstraction has 55330 states and 183290 transitions. [2019-12-27 15:54:41,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:54:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 55330 states and 183290 transitions. [2019-12-27 15:54:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:54:41,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:41,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:41,762 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:41,762 INFO L82 PathProgramCache]: Analyzing trace with hash 285364695, now seen corresponding path program 1 times [2019-12-27 15:54:41,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:41,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753071943] [2019-12-27 15:54:41,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:41,808 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-27 15:54:41,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753071943] [2019-12-27 15:54:41,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:41,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:54:41,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1950334912] [2019-12-27 15:54:41,809 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:41,811 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:41,816 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 15:54:41,817 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:41,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:54:41,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:41,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:41,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:41,832 INFO L87 Difference]: Start difference. First operand 55330 states and 183290 transitions. Second operand 5 states. [2019-12-27 15:54:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:42,400 INFO L93 Difference]: Finished difference Result 68586 states and 223928 transitions. [2019-12-27 15:54:42,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:54:42,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 15:54:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:42,533 INFO L225 Difference]: With dead ends: 68586 [2019-12-27 15:54:42,534 INFO L226 Difference]: Without dead ends: 68569 [2019-12-27 15:54:42,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68569 states. [2019-12-27 15:54:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68569 to 56099. [2019-12-27 15:54:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56099 states. [2019-12-27 15:54:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56099 states to 56099 states and 185794 transitions. [2019-12-27 15:54:44,056 INFO L78 Accepts]: Start accepts. Automaton has 56099 states and 185794 transitions. Word has length 17 [2019-12-27 15:54:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:44,057 INFO L462 AbstractCegarLoop]: Abstraction has 56099 states and 185794 transitions. [2019-12-27 15:54:44,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 56099 states and 185794 transitions. [2019-12-27 15:54:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 15:54:44,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:44,069 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] [2019-12-27 15:54:44,069 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:44,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:44,070 INFO L82 PathProgramCache]: Analyzing trace with hash -762555601, now seen corresponding path program 1 times [2019-12-27 15:54:44,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:44,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430327287] [2019-12-27 15:54:44,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:44,136 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-27 15:54:44,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430327287] [2019-12-27 15:54:44,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:44,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:44,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [546367137] [2019-12-27 15:54:44,138 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:44,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:44,425 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 54 transitions. [2019-12-27 15:54:44,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:44,426 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:44,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:44,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:44,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:44,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:44,427 INFO L87 Difference]: Start difference. First operand 56099 states and 185794 transitions. Second operand 5 states. [2019-12-27 15:54:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:45,289 INFO L93 Difference]: Finished difference Result 78809 states and 254697 transitions. [2019-12-27 15:54:45,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:54:45,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 15:54:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:45,436 INFO L225 Difference]: With dead ends: 78809 [2019-12-27 15:54:45,437 INFO L226 Difference]: Without dead ends: 78795 [2019-12-27 15:54:45,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:54:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78795 states. [2019-12-27 15:54:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78795 to 61307. [2019-12-27 15:54:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61307 states. [2019-12-27 15:54:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61307 states to 61307 states and 202072 transitions. [2019-12-27 15:54:48,803 INFO L78 Accepts]: Start accepts. Automaton has 61307 states and 202072 transitions. Word has length 20 [2019-12-27 15:54:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:48,804 INFO L462 AbstractCegarLoop]: Abstraction has 61307 states and 202072 transitions. [2019-12-27 15:54:48,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 61307 states and 202072 transitions. [2019-12-27 15:54:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:54:48,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:48,821 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] [2019-12-27 15:54:48,821 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash -915737050, now seen corresponding path program 1 times [2019-12-27 15:54:48,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:48,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878124906] [2019-12-27 15:54:48,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:48,892 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-27 15:54:48,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878124906] [2019-12-27 15:54:48,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:48,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:48,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1562472834] [2019-12-27 15:54:48,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:48,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:48,903 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 15:54:48,904 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:48,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:48,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:54:48,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:48,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:54:48,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:54:48,906 INFO L87 Difference]: Start difference. First operand 61307 states and 202072 transitions. Second operand 4 states. [2019-12-27 15:54:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:48,981 INFO L93 Difference]: Finished difference Result 11362 states and 30298 transitions. [2019-12-27 15:54:48,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:54:48,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 15:54:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:48,990 INFO L225 Difference]: With dead ends: 11362 [2019-12-27 15:54:48,990 INFO L226 Difference]: Without dead ends: 7054 [2019-12-27 15:54:48,991 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-27 15:54:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2019-12-27 15:54:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 7010. [2019-12-27 15:54:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7010 states. [2019-12-27 15:54:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 16196 transitions. [2019-12-27 15:54:49,061 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 16196 transitions. Word has length 23 [2019-12-27 15:54:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:49,062 INFO L462 AbstractCegarLoop]: Abstraction has 7010 states and 16196 transitions. [2019-12-27 15:54:49,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:54:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 16196 transitions. [2019-12-27 15:54:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 15:54:49,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:49,066 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] [2019-12-27 15:54:49,066 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:49,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:49,067 INFO L82 PathProgramCache]: Analyzing trace with hash 484194479, now seen corresponding path program 1 times [2019-12-27 15:54:49,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:49,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493632171] [2019-12-27 15:54:49,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:49,115 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-27 15:54:49,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493632171] [2019-12-27 15:54:49,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:49,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:49,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132950487] [2019-12-27 15:54:49,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:49,121 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:49,497 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 111 transitions. [2019-12-27 15:54:49,498 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:49,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:54:49,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:49,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:49,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:49,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:49,527 INFO L87 Difference]: Start difference. First operand 7010 states and 16196 transitions. Second operand 5 states. [2019-12-27 15:54:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:49,656 INFO L93 Difference]: Finished difference Result 7678 states and 16747 transitions. [2019-12-27 15:54:49,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:49,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 15:54:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:49,667 INFO L225 Difference]: With dead ends: 7678 [2019-12-27 15:54:49,668 INFO L226 Difference]: Without dead ends: 7678 [2019-12-27 15:54:49,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:49,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7678 states. [2019-12-27 15:54:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7678 to 7092. [2019-12-27 15:54:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7092 states. [2019-12-27 15:54:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7092 states to 7092 states and 15530 transitions. [2019-12-27 15:54:49,758 INFO L78 Accepts]: Start accepts. Automaton has 7092 states and 15530 transitions. Word has length 31 [2019-12-27 15:54:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:49,759 INFO L462 AbstractCegarLoop]: Abstraction has 7092 states and 15530 transitions. [2019-12-27 15:54:49,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 7092 states and 15530 transitions. [2019-12-27 15:54:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:54:49,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:49,765 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] [2019-12-27 15:54:49,765 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:49,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1443742418, now seen corresponding path program 1 times [2019-12-27 15:54:49,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:49,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551377757] [2019-12-27 15:54:49,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:49,845 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-27 15:54:49,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551377757] [2019-12-27 15:54:49,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:49,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:49,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [521894907] [2019-12-27 15:54:49,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:49,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:49,874 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 126 transitions. [2019-12-27 15:54:49,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:49,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:54:49,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:54:49,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:49,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:54:49,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:49,893 INFO L87 Difference]: Start difference. First operand 7092 states and 15530 transitions. Second operand 6 states. [2019-12-27 15:54:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:50,364 INFO L93 Difference]: Finished difference Result 8001 states and 17262 transitions. [2019-12-27 15:54:50,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:54:50,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 15:54:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:50,374 INFO L225 Difference]: With dead ends: 8001 [2019-12-27 15:54:50,374 INFO L226 Difference]: Without dead ends: 8000 [2019-12-27 15:54:50,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:54:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8000 states. [2019-12-27 15:54:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8000 to 6268. [2019-12-27 15:54:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6268 states. [2019-12-27 15:54:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 13863 transitions. [2019-12-27 15:54:50,443 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 13863 transitions. Word has length 34 [2019-12-27 15:54:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:50,443 INFO L462 AbstractCegarLoop]: Abstraction has 6268 states and 13863 transitions. [2019-12-27 15:54:50,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:54:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 13863 transitions. [2019-12-27 15:54:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:54:50,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:50,450 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] [2019-12-27 15:54:50,450 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:50,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash -774360428, now seen corresponding path program 1 times [2019-12-27 15:54:50,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:50,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933338836] [2019-12-27 15:54:50,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:50,524 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-27 15:54:50,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933338836] [2019-12-27 15:54:50,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:50,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:50,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [89165445] [2019-12-27 15:54:50,525 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:50,533 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:50,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 41 transitions. [2019-12-27 15:54:50,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:50,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:50,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:50,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:50,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:50,548 INFO L87 Difference]: Start difference. First operand 6268 states and 13863 transitions. Second operand 5 states. [2019-12-27 15:54:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:50,697 INFO L93 Difference]: Finished difference Result 9283 states and 20621 transitions. [2019-12-27 15:54:50,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:54:50,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 15:54:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:50,710 INFO L225 Difference]: With dead ends: 9283 [2019-12-27 15:54:50,710 INFO L226 Difference]: Without dead ends: 7431 [2019-12-27 15:54:50,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:54:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2019-12-27 15:54:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7431. [2019-12-27 15:54:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7431 states. [2019-12-27 15:54:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7431 states to 7431 states and 16520 transitions. [2019-12-27 15:54:50,832 INFO L78 Accepts]: Start accepts. Automaton has 7431 states and 16520 transitions. Word has length 41 [2019-12-27 15:54:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:50,833 INFO L462 AbstractCegarLoop]: Abstraction has 7431 states and 16520 transitions. [2019-12-27 15:54:50,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 7431 states and 16520 transitions. [2019-12-27 15:54:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 15:54:50,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:50,846 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] [2019-12-27 15:54:50,846 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:50,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:50,847 INFO L82 PathProgramCache]: Analyzing trace with hash 102105480, now seen corresponding path program 1 times [2019-12-27 15:54:50,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:50,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255195264] [2019-12-27 15:54:50,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:50,922 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-27 15:54:50,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255195264] [2019-12-27 15:54:50,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:50,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:54:50,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290262470] [2019-12-27 15:54:50,923 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:50,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:50,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 42 transitions. [2019-12-27 15:54:50,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:50,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:50,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:50,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:50,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:50,947 INFO L87 Difference]: Start difference. First operand 7431 states and 16520 transitions. Second operand 5 states. [2019-12-27 15:54:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:51,414 INFO L93 Difference]: Finished difference Result 8540 states and 18759 transitions. [2019-12-27 15:54:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:54:51,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 15:54:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:51,425 INFO L225 Difference]: With dead ends: 8540 [2019-12-27 15:54:51,426 INFO L226 Difference]: Without dead ends: 8540 [2019-12-27 15:54:51,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8540 states. [2019-12-27 15:54:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8540 to 8196. [2019-12-27 15:54:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-27 15:54:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 18092 transitions. [2019-12-27 15:54:51,549 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 18092 transitions. Word has length 42 [2019-12-27 15:54:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:51,549 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 18092 transitions. [2019-12-27 15:54:51,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 18092 transitions. [2019-12-27 15:54:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 15:54:51,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:51,563 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] [2019-12-27 15:54:51,563 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:51,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:51,563 INFO L82 PathProgramCache]: Analyzing trace with hash -743886017, now seen corresponding path program 1 times [2019-12-27 15:54:51,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:51,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320031561] [2019-12-27 15:54:51,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:51,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320031561] [2019-12-27 15:54:51,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:51,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:54:51,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [935124216] [2019-12-27 15:54:51,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:51,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:51,661 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 15:54:51,661 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:51,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:51,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:51,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:51,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:51,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:51,663 INFO L87 Difference]: Start difference. First operand 8196 states and 18092 transitions. Second operand 5 states. [2019-12-27 15:54:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:52,077 INFO L93 Difference]: Finished difference Result 9041 states and 19641 transitions. [2019-12-27 15:54:52,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:54:52,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 15:54:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:52,086 INFO L225 Difference]: With dead ends: 9041 [2019-12-27 15:54:52,087 INFO L226 Difference]: Without dead ends: 9041 [2019-12-27 15:54:52,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9041 states. [2019-12-27 15:54:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9041 to 8167. [2019-12-27 15:54:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8167 states. [2019-12-27 15:54:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8167 states to 8167 states and 17685 transitions. [2019-12-27 15:54:52,767 INFO L78 Accepts]: Start accepts. Automaton has 8167 states and 17685 transitions. Word has length 43 [2019-12-27 15:54:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:52,767 INFO L462 AbstractCegarLoop]: Abstraction has 8167 states and 17685 transitions. [2019-12-27 15:54:52,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 8167 states and 17685 transitions. [2019-12-27 15:54:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 15:54:52,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:52,777 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] [2019-12-27 15:54:52,777 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:52,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:52,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2031288696, now seen corresponding path program 1 times [2019-12-27 15:54:52,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:52,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025770755] [2019-12-27 15:54:52,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:52,885 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-27 15:54:52,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025770755] [2019-12-27 15:54:52,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:52,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:54:52,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786871891] [2019-12-27 15:54:52,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:52,895 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:52,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 43 transitions. [2019-12-27 15:54:52,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:52,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:52,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:52,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:52,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:52,910 INFO L87 Difference]: Start difference. First operand 8167 states and 17685 transitions. Second operand 5 states. [2019-12-27 15:54:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:52,969 INFO L93 Difference]: Finished difference Result 5420 states and 11591 transitions. [2019-12-27 15:54:52,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:54:52,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 15:54:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:52,976 INFO L225 Difference]: With dead ends: 5420 [2019-12-27 15:54:52,977 INFO L226 Difference]: Without dead ends: 5102 [2019-12-27 15:54:52,978 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-27 15:54:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2019-12-27 15:54:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 4812. [2019-12-27 15:54:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4812 states. [2019-12-27 15:54:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 10392 transitions. [2019-12-27 15:54:53,051 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 10392 transitions. Word has length 43 [2019-12-27 15:54:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:53,051 INFO L462 AbstractCegarLoop]: Abstraction has 4812 states and 10392 transitions. [2019-12-27 15:54:53,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 10392 transitions. [2019-12-27 15:54:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 15:54:53,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:53,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:53,061 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash -687344087, now seen corresponding path program 1 times [2019-12-27 15:54:53,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:53,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350197946] [2019-12-27 15:54:53,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:53,136 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-27 15:54:53,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350197946] [2019-12-27 15:54:53,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:53,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:53,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1270689942] [2019-12-27 15:54:53,137 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:53,159 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:53,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 207 transitions. [2019-12-27 15:54:53,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:53,276 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:54:53,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:53,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:53,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:53,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:53,277 INFO L87 Difference]: Start difference. First operand 4812 states and 10392 transitions. Second operand 5 states. [2019-12-27 15:54:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:53,312 INFO L93 Difference]: Finished difference Result 5623 states and 12060 transitions. [2019-12-27 15:54:53,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:54:53,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-27 15:54:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:53,314 INFO L225 Difference]: With dead ends: 5623 [2019-12-27 15:54:53,314 INFO L226 Difference]: Without dead ends: 878 [2019-12-27 15:54:53,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-12-27 15:54:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2019-12-27 15:54:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-27 15:54:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1758 transitions. [2019-12-27 15:54:53,329 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1758 transitions. Word has length 59 [2019-12-27 15:54:53,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:53,329 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1758 transitions. [2019-12-27 15:54:53,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1758 transitions. [2019-12-27 15:54:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 15:54:53,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:53,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:53,331 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash 472534802, now seen corresponding path program 1 times [2019-12-27 15:54:53,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:53,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397865514] [2019-12-27 15:54:53,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:53,427 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-27 15:54:53,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397865514] [2019-12-27 15:54:53,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:53,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:54:53,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1091214454] [2019-12-27 15:54:53,428 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:53,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:53,512 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 119 transitions. [2019-12-27 15:54:53,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:53,569 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 15:54:53,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:54:53,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:53,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:54:53,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:54:53,570 INFO L87 Difference]: Start difference. First operand 878 states and 1758 transitions. Second operand 10 states. [2019-12-27 15:54:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:54,322 INFO L93 Difference]: Finished difference Result 2798 states and 5363 transitions. [2019-12-27 15:54:54,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 15:54:54,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-27 15:54:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:54,326 INFO L225 Difference]: With dead ends: 2798 [2019-12-27 15:54:54,326 INFO L226 Difference]: Without dead ends: 2063 [2019-12-27 15:54:54,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2019-12-27 15:54:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2019-12-27 15:54:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 928. [2019-12-27 15:54:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-12-27 15:54:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1832 transitions. [2019-12-27 15:54:54,339 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1832 transitions. Word has length 59 [2019-12-27 15:54:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:54,339 INFO L462 AbstractCegarLoop]: Abstraction has 928 states and 1832 transitions. [2019-12-27 15:54:54,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:54:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1832 transitions. [2019-12-27 15:54:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 15:54:54,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:54:54,341 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:54,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:54,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1337355214, now seen corresponding path program 2 times [2019-12-27 15:54:54,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:54,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294077822] [2019-12-27 15:54:54,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:54,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294077822] [2019-12-27 15:54:54,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:54,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:54:54,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1332963058] [2019-12-27 15:54:54,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:54,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:54,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 89 transitions. [2019-12-27 15:54:54,562 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:54,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:54:54,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:54:54,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:54,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:54:54,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:54:54,593 INFO L87 Difference]: Start difference. First operand 928 states and 1832 transitions. Second operand 10 states. [2019-12-27 15:54:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:55,555 INFO L93 Difference]: Finished difference Result 1867 states and 3541 transitions. [2019-12-27 15:54:55,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 15:54:55,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-27 15:54:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:55,558 INFO L225 Difference]: With dead ends: 1867 [2019-12-27 15:54:55,558 INFO L226 Difference]: Without dead ends: 1867 [2019-12-27 15:54:55,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:54:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2019-12-27 15:54:55,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 937. [2019-12-27 15:54:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-27 15:54:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1850 transitions. [2019-12-27 15:54:55,571 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1850 transitions. Word has length 59 [2019-12-27 15:54:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:55,571 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 1850 transitions. [2019-12-27 15:54:55,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:54:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1850 transitions. [2019-12-27 15:54:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 15:54:55,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:55,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:55,573 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:55,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:55,573 INFO L82 PathProgramCache]: Analyzing trace with hash -656253202, now seen corresponding path program 3 times [2019-12-27 15:54:55,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:55,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016661286] [2019-12-27 15:54:55,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:54:55,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016661286] [2019-12-27 15:54:55,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:55,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:54:55,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1345065782] [2019-12-27 15:54:55,707 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:55,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:55,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 168 transitions. [2019-12-27 15:54:55,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:55,896 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:54:55,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:54:55,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:55,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:54:55,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:54:55,897 INFO L87 Difference]: Start difference. First operand 937 states and 1850 transitions. Second operand 7 states. [2019-12-27 15:54:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:56,526 INFO L93 Difference]: Finished difference Result 1603 states and 3173 transitions. [2019-12-27 15:54:56,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:54:56,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 15:54:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:56,528 INFO L225 Difference]: With dead ends: 1603 [2019-12-27 15:54:56,528 INFO L226 Difference]: Without dead ends: 1603 [2019-12-27 15:54:56,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:54:56,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-12-27 15:54:56,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1018. [2019-12-27 15:54:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-12-27 15:54:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2035 transitions. [2019-12-27 15:54:56,541 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2035 transitions. Word has length 59 [2019-12-27 15:54:56,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:56,541 INFO L462 AbstractCegarLoop]: Abstraction has 1018 states and 2035 transitions. [2019-12-27 15:54:56,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:54:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2035 transitions. [2019-12-27 15:54:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 15:54:56,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:56,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:56,543 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:56,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:56,544 INFO L82 PathProgramCache]: Analyzing trace with hash -308873018, now seen corresponding path program 4 times [2019-12-27 15:54:56,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:56,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527756433] [2019-12-27 15:54:56,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:56,607 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-27 15:54:56,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527756433] [2019-12-27 15:54:56,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:56,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:54:56,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1484933023] [2019-12-27 15:54:56,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:56,623 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:56,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 127 transitions. [2019-12-27 15:54:56,691 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:56,691 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:56,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:54:56,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:56,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:54:56,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:56,692 INFO L87 Difference]: Start difference. First operand 1018 states and 2035 transitions. Second operand 3 states. [2019-12-27 15:54:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:56,704 INFO L93 Difference]: Finished difference Result 1017 states and 2033 transitions. [2019-12-27 15:54:56,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:56,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 15:54:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:56,706 INFO L225 Difference]: With dead ends: 1017 [2019-12-27 15:54:56,706 INFO L226 Difference]: Without dead ends: 1017 [2019-12-27 15:54:56,707 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-27 15:54:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-12-27 15:54:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 874. [2019-12-27 15:54:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-12-27 15:54:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1770 transitions. [2019-12-27 15:54:56,718 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1770 transitions. Word has length 59 [2019-12-27 15:54:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:56,718 INFO L462 AbstractCegarLoop]: Abstraction has 874 states and 1770 transitions. [2019-12-27 15:54:56,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:54:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1770 transitions. [2019-12-27 15:54:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 15:54:56,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:56,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:56,719 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:54:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1424316398, now seen corresponding path program 1 times [2019-12-27 15:54:56,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:56,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692029788] [2019-12-27 15:54:56,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:54:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:54:56,885 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:54:56,885 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:54:56,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] ULTIMATE.startENTRY-->L808: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x$w_buff0~0_184) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t311~0.base_35|)) (= v_~x$r_buff0_thd0~0_104 0) (= v_~x$flush_delayed~0_211 0) (= 0 v_~x$w_buff1~0_179) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= 0 v_~x~0_237) (= 0 v_~x$mem_tmp~0_172) (= 0 v_~x$r_buff1_thd2~0_289) (= v_~y~0_71 0) (= v_~__unbuffered_p1_EBX~0_59 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~main$tmp_guard1~0_39 0) (= 0 v_~__unbuffered_cnt~0_51) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_189 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_243 0) (= v_~main$tmp_guard0~0_35 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff1_used~0_431) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t311~0.base_35|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t311~0.base_35| 4)) (= (store .cse0 |v_ULTIMATE.start_main_~#t311~0.base_35| 1) |v_#valid_53|) (= v_~x$r_buff0_thd1~0_285 0) (= 0 v_~x$r_buff0_thd2~0_420) (= v_~x$r_buff1_thd1~0_241 0) (= 0 |v_ULTIMATE.start_main_~#t311~0.offset_25|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$w_buff0_used~0_795) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_35|) |v_ULTIMATE.start_main_~#t311~0.offset_25| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_285, ~x$flush_delayed~0=v_~x$flush_delayed~0_211, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_241, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ~x$mem_tmp~0=v_~x$mem_tmp~0_172, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_19|, ~y~0=v_~y~0_71, ULTIMATE.start_main_~#t311~0.offset=|v_ULTIMATE.start_main_~#t311~0.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_59, ~x$w_buff1~0=v_~x$w_buff1~0_179, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_35|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_431, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_289, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_169|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_35, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_189, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_420, ULTIMATE.start_main_~#t311~0.base=|v_ULTIMATE.start_main_~#t311~0.base_35|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_79|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_229|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_27|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_243, ~x~0=v_~x~0_237, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t312~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t311~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t311~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 15:54:56,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L808-1-->L810: Formula: (and (not (= |v_ULTIMATE.start_main_~#t312~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11|) |v_ULTIMATE.start_main_~#t312~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t312~0.offset_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11| 1)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11|) 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t312~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t312~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, #length, ULTIMATE.start_main_~#t312~0.offset] because there is no mapped edge [2019-12-27 15:54:56,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= 1 v_~x$w_buff0~0_24) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_123) (= v_~x$w_buff0~0_25 v_~x$w_buff1~0_31) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| 1) (= v_~x$w_buff1_used~0_76 v_~x$w_buff0_used~0_124) (= 0 (mod v_~x$w_buff1_used~0_76 256)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_6)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_25, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_24, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_31, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 15:54:56,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L770-2-->L770-4: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1494951983 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1494951983 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out-1494951983| ~x$w_buff0~0_In-1494951983) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-1494951983| ~x$w_buff1~0_In-1494951983)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1494951983, ~x$w_buff1~0=~x$w_buff1~0_In-1494951983, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1494951983, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1494951983} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1494951983, ~x$w_buff1~0=~x$w_buff1~0_In-1494951983, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1494951983, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1494951983|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1494951983} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 15:54:56,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L770-4-->L771: Formula: (= v_~x~0_35 |v_P1Thread1of1ForFork1_#t~ite28_14|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_14|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_13|, ~x~0=v_~x~0_35, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 15:54:56,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L775-->L776: Formula: (and (= v_~x$r_buff0_thd2~0_206 v_~x$r_buff0_thd2~0_205) (not (= 0 (mod v_~weak$$choice2~0_111 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_206, ~weak$$choice2~0=v_~weak$$choice2~0_111} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_13|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_10|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_12|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_111} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 15:54:56,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In2102383268 256) 0))) (or (and .cse0 (= ~x~0_In2102383268 |P1Thread1of1ForFork1_#t~ite48_Out2102383268|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite48_Out2102383268| ~x$mem_tmp~0_In2102383268)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In2102383268, ~x$mem_tmp~0=~x$mem_tmp~0_In2102383268, ~x~0=~x~0_In2102383268} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In2102383268, ~x$mem_tmp~0=~x$mem_tmp~0_In2102383268, ~x~0=~x~0_In2102383268, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out2102383268|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 15:54:56,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1561012975 256) 0))) (or (and (= ~x~0_In1561012975 |P0Thread1of1ForFork0_#t~ite25_Out1561012975|) .cse0) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out1561012975| ~x$mem_tmp~0_In1561012975)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1561012975, ~x$mem_tmp~0=~x$mem_tmp~0_In1561012975, ~x~0=~x~0_In1561012975} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out1561012975|, ~x$flush_delayed~0=~x$flush_delayed~0_In1561012975, ~x$mem_tmp~0=~x$mem_tmp~0_In1561012975, ~x~0=~x~0_In1561012975} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 15:54:56,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite25_20| v_~x~0_109) (= v_~x$flush_delayed~0_78 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 15:54:56,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1101979692 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1101979692 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-1101979692|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1101979692 |P1Thread1of1ForFork1_#t~ite51_Out-1101979692|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1101979692, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1101979692} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1101979692|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1101979692, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1101979692} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 15:54:56,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-645517935 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-645517935 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-645517935 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-645517935 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-645517935|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-645517935 |P1Thread1of1ForFork1_#t~ite52_Out-645517935|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-645517935, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-645517935, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-645517935, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-645517935} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-645517935|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-645517935, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-645517935, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-645517935, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-645517935} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 15:54:56,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L788-->L789: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1785527590 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1785527590 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1785527590 ~x$r_buff0_thd2~0_Out-1785527590)) (and (= 0 ~x$r_buff0_thd2~0_Out-1785527590) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1785527590, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1785527590} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1785527590|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1785527590, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1785527590} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 15:54:56,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In1052202520 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1052202520 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1052202520 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1052202520 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite54_Out1052202520|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In1052202520 |P1Thread1of1ForFork1_#t~ite54_Out1052202520|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1052202520, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1052202520, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1052202520, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1052202520} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1052202520, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1052202520, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1052202520|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1052202520, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1052202520} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 15:54:56,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$r_buff1_thd2~0_141 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 15:54:56,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L814-->L816-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~x$w_buff0_used~0_229 256)) (= (mod v_~x$r_buff0_thd0~0_27 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 15:54:56,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L816-2-->L816-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-200726447 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-200726447 256) 0))) (or (and (= ~x$w_buff1~0_In-200726447 |ULTIMATE.start_main_#t~ite57_Out-200726447|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite57_Out-200726447| ~x~0_In-200726447) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-200726447, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-200726447, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-200726447, ~x~0=~x~0_In-200726447} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-200726447, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-200726447|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-200726447, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-200726447, ~x~0=~x~0_In-200726447} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 15:54:56,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L816-4-->L817: Formula: (= v_~x~0_76 |v_ULTIMATE.start_main_#t~ite57_12|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_11|, ~x~0=v_~x~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x~0] because there is no mapped edge [2019-12-27 15:54:56,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1637913135 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1637913135 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite59_Out-1637913135|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1637913135 |ULTIMATE.start_main_#t~ite59_Out-1637913135|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1637913135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1637913135} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1637913135, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1637913135|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1637913135} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 15:54:56,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In490297752 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In490297752 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In490297752 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In490297752 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out490297752| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In490297752 |ULTIMATE.start_main_#t~ite60_Out490297752|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In490297752, ~x$w_buff1_used~0=~x$w_buff1_used~0_In490297752, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In490297752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In490297752} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In490297752, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out490297752|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In490297752, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In490297752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In490297752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 15:54:56,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1501637221 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1501637221 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1501637221 |ULTIMATE.start_main_#t~ite61_Out1501637221|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1501637221| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1501637221, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1501637221} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1501637221, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1501637221|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1501637221} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 15:54:56,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1508518990 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1508518990 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1508518990 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1508518990 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1508518990| ~x$r_buff1_thd0~0_In1508518990) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite62_Out1508518990| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1508518990, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1508518990, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1508518990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1508518990} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1508518990|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1508518990, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1508518990, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1508518990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1508518990} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 15:54:56,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L820-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_~x$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite62_47|) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~__unbuffered_p0_EAX~0_27) (= v_~__unbuffered_p1_EBX~0_35 0) (= 1 v_~__unbuffered_p1_EAX~0_36)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_171, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:54:57,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:54:57 BasicIcfg [2019-12-27 15:54:57,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:54:57,055 INFO L168 Benchmark]: Toolchain (without parser) took 42786.76 ms. Allocated memory was 137.9 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 101.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 498.3 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:57,055 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 15:54:57,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.87 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 155.6 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:57,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.74 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:57,057 INFO L168 Benchmark]: Boogie Preprocessor took 57.23 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:57,058 INFO L168 Benchmark]: RCFGBuilder took 1001.75 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 97.8 MB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:57,058 INFO L168 Benchmark]: TraceAbstraction took 40852.92 ms. Allocated memory was 202.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 97.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 429.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:54:57,062 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.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.87 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 155.6 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.74 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.23 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1001.75 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 97.8 MB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40852.92 ms. Allocated memory was 202.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 97.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 429.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 178 ProgramPointsBefore, 103 ProgramPointsAfterwards, 227 TransitionsBefore, 126 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 29 ChoiceCompositions, 8870 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 290 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 122314 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L808] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L761] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L762] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L763] 2 x$r_buff0_thd2 = (_Bool)1 [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 x$flush_delayed = weak$$choice2 [L769] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = x$flush_delayed ? x$mem_tmp : x [L779] 2 x$flush_delayed = (_Bool)0 [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 1 y = 1 [L730] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L731] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L732] 1 x$flush_delayed = weak$$choice2 [L733] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 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) [L735] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 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)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 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)) [L737] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 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)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 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)) [L739] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 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)) [L741] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 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) [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 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 [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L818] 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 [L819] 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 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 40.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3811 SDtfs, 4241 SDslu, 7489 SDs, 0 SdLazy, 4061 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 54 SyntacticMatches, 16 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61307occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 49334 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 80523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...