/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:55:19,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:55:19,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:55:20,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:55:20,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:55:20,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:55:20,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:55:20,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:55:20,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:55:20,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:55:20,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:55:20,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:55:20,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:55:20,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:55:20,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:55:20,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:55:20,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:55:20,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:55:20,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:55:20,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:55:20,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:55:20,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:55:20,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:55:20,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:55:20,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:55:20,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:55:20,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:55:20,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:55:20,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:55:20,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:55:20,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:55:20,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:55:20,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:55:20,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:55:20,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:55:20,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:55:20,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:55:20,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:55:20,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:55:20,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:55:20,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:55:20,034 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-VariableLbe-MCR.epf [2019-12-27 20:55:20,055 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:55:20,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:55:20,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:55:20,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:55:20,057 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:55:20,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:55:20,058 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:55:20,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:55:20,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:55:20,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:55:20,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:55:20,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:55:20,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:55:20,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:55:20,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:55:20,060 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:55:20,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:55:20,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:55:20,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:55:20,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:55:20,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:55:20,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:55:20,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:55:20,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:55:20,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:55:20,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:55:20,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:55:20,063 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:55:20,063 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:55:20,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:55:20,064 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:55:20,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:55:20,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:55:20,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:55:20,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:55:20,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:55:20,365 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:55:20,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.opt.i [2019-12-27 20:55:20,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4779f2e50/b8da3ccbc36a4efc8ae72e2fcfa0dfd5/FLAG886736229 [2019-12-27 20:55:21,003 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:55:21,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_rmo.opt.i [2019-12-27 20:55:21,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4779f2e50/b8da3ccbc36a4efc8ae72e2fcfa0dfd5/FLAG886736229 [2019-12-27 20:55:21,278 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4779f2e50/b8da3ccbc36a4efc8ae72e2fcfa0dfd5 [2019-12-27 20:55:21,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:55:21,290 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:55:21,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:55:21,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:55:21,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:55:21,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:55:21" (1/1) ... [2019-12-27 20:55:21,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:21, skipping insertion in model container [2019-12-27 20:55:21,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:55:21" (1/1) ... [2019-12-27 20:55:21,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:55:21,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:55:21,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:55:21,999 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:55:22,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:55:22,137 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:55:22,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22 WrapperNode [2019-12-27 20:55:22,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:55:22,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:55:22,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:55:22,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:55:22,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:55:22,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:55:22,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:55:22,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:55:22,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:55:22,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:55:22,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:55:22,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:55:22,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (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 20:55:22,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:55:22,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:55:22,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:55:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:55:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:55:22,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:55:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:55:22,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:55:22,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:55:22,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:55:22,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:55:22,306 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 20:55:22,982 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:55:22,982 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:55:22,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:55:22 BoogieIcfgContainer [2019-12-27 20:55:22,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:55:22,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:55:22,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:55:22,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:55:22,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:55:21" (1/3) ... [2019-12-27 20:55:22,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a792a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:55:22, skipping insertion in model container [2019-12-27 20:55:22,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (2/3) ... [2019-12-27 20:55:22,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a792a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:55:22, skipping insertion in model container [2019-12-27 20:55:22,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:55:22" (3/3) ... [2019-12-27 20:55:22,993 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.opt.i [2019-12-27 20:55:23,004 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:55:23,005 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:55:23,013 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:55:23,014 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:55:23,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,053 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,054 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,079 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,080 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,080 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,080 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,081 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,101 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,101 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,133 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:55:23,152 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:55:23,152 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:55:23,152 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:55:23,153 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:55:23,153 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:55:23,153 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:55:23,153 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:55:23,153 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:55:23,170 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-27 20:55:23,172 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-27 20:55:23,281 INFO L132 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-27 20:55:23,282 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:55:23,297 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/128 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 20:55:23,313 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-27 20:55:23,391 INFO L132 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-27 20:55:23,392 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:55:23,399 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/128 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 20:55:23,411 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 20:55:23,412 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:55:26,674 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-27 20:55:26,792 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-27 20:55:26,937 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 20:55:27,065 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:55:27,101 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46171 [2019-12-27 20:55:27,101 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 20:55:27,104 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 79 transitions [2019-12-27 20:55:27,454 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6786 states. [2019-12-27 20:55:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6786 states. [2019-12-27 20:55:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:55:27,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:27,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:55:27,464 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:27,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:27,471 INFO L82 PathProgramCache]: Analyzing trace with hash 687166048, now seen corresponding path program 1 times [2019-12-27 20:55:27,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:27,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531639795] [2019-12-27 20:55:27,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:27,698 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 20:55:27,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531639795] [2019-12-27 20:55:27,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:27,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:55:27,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1061764501] [2019-12-27 20:55:27,703 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:27,708 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:27,722 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:55:27,722 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:27,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:27,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:27,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:27,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:27,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:27,746 INFO L87 Difference]: Start difference. First operand 6786 states. Second operand 3 states. [2019-12-27 20:55:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:27,938 INFO L93 Difference]: Finished difference Result 6626 states and 22242 transitions. [2019-12-27 20:55:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:27,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:55:27,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:28,011 INFO L225 Difference]: With dead ends: 6626 [2019-12-27 20:55:28,011 INFO L226 Difference]: Without dead ends: 6242 [2019-12-27 20:55:28,012 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 20:55:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6242 states. [2019-12-27 20:55:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6242 to 6242. [2019-12-27 20:55:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6242 states. [2019-12-27 20:55:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6242 states to 6242 states and 20914 transitions. [2019-12-27 20:55:28,415 INFO L78 Accepts]: Start accepts. Automaton has 6242 states and 20914 transitions. Word has length 5 [2019-12-27 20:55:28,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:28,416 INFO L462 AbstractCegarLoop]: Abstraction has 6242 states and 20914 transitions. [2019-12-27 20:55:28,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6242 states and 20914 transitions. [2019-12-27 20:55:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:55:28,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:28,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:28,420 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:28,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:28,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1092588283, now seen corresponding path program 1 times [2019-12-27 20:55:28,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:28,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671790823] [2019-12-27 20:55:28,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:28,515 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 20:55:28,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671790823] [2019-12-27 20:55:28,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:28,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:28,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [343211839] [2019-12-27 20:55:28,516 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:28,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:28,521 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:55:28,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:28,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:28,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:28,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:28,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:28,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:28,526 INFO L87 Difference]: Start difference. First operand 6242 states and 20914 transitions. Second operand 3 states. [2019-12-27 20:55:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:28,562 INFO L93 Difference]: Finished difference Result 1244 states and 3068 transitions. [2019-12-27 20:55:28,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:28,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:55:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:28,571 INFO L225 Difference]: With dead ends: 1244 [2019-12-27 20:55:28,571 INFO L226 Difference]: Without dead ends: 1244 [2019-12-27 20:55:28,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-12-27 20:55:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1244. [2019-12-27 20:55:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-12-27 20:55:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3068 transitions. [2019-12-27 20:55:28,607 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3068 transitions. Word has length 11 [2019-12-27 20:55:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:28,607 INFO L462 AbstractCegarLoop]: Abstraction has 1244 states and 3068 transitions. [2019-12-27 20:55:28,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3068 transitions. [2019-12-27 20:55:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:28,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:28,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:28,617 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash 97322610, now seen corresponding path program 1 times [2019-12-27 20:55:28,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:28,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399325542] [2019-12-27 20:55:28,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:28,736 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 20:55:28,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399325542] [2019-12-27 20:55:28,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:28,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:28,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1082016329] [2019-12-27 20:55:28,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:28,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:28,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:55:28,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:28,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:55:28,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:28,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:28,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:28,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:28,795 INFO L87 Difference]: Start difference. First operand 1244 states and 3068 transitions. Second operand 5 states. [2019-12-27 20:55:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:28,900 INFO L93 Difference]: Finished difference Result 1899 states and 4747 transitions. [2019-12-27 20:55:28,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:28,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:55:28,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:28,914 INFO L225 Difference]: With dead ends: 1899 [2019-12-27 20:55:28,915 INFO L226 Difference]: Without dead ends: 1899 [2019-12-27 20:55:28,915 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 20:55:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-12-27 20:55:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1383. [2019-12-27 20:55:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2019-12-27 20:55:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 3459 transitions. [2019-12-27 20:55:28,960 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 3459 transitions. Word has length 14 [2019-12-27 20:55:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:28,960 INFO L462 AbstractCegarLoop]: Abstraction has 1383 states and 3459 transitions. [2019-12-27 20:55:28,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 3459 transitions. [2019-12-27 20:55:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:28,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:28,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:28,962 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:28,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:28,962 INFO L82 PathProgramCache]: Analyzing trace with hash 234592346, now seen corresponding path program 1 times [2019-12-27 20:55:28,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:28,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155941395] [2019-12-27 20:55:28,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:29,061 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 20:55:29,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155941395] [2019-12-27 20:55:29,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:29,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:29,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1944534366] [2019-12-27 20:55:29,066 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:29,069 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:29,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:55:29,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:29,097 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:29,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:29,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:29,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:29,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:29,100 INFO L87 Difference]: Start difference. First operand 1383 states and 3459 transitions. Second operand 5 states. [2019-12-27 20:55:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:29,327 INFO L93 Difference]: Finished difference Result 1804 states and 4372 transitions. [2019-12-27 20:55:29,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:55:29,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:55:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:29,339 INFO L225 Difference]: With dead ends: 1804 [2019-12-27 20:55:29,339 INFO L226 Difference]: Without dead ends: 1804 [2019-12-27 20:55:29,340 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 20:55:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2019-12-27 20:55:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1672. [2019-12-27 20:55:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-12-27 20:55:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 4077 transitions. [2019-12-27 20:55:29,392 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 4077 transitions. Word has length 14 [2019-12-27 20:55:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:29,393 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 4077 transitions. [2019-12-27 20:55:29,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 4077 transitions. [2019-12-27 20:55:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:29,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:29,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:29,396 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:29,396 INFO L82 PathProgramCache]: Analyzing trace with hash -489618057, now seen corresponding path program 1 times [2019-12-27 20:55:29,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:29,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186707989] [2019-12-27 20:55:29,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:29,484 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 20:55:29,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186707989] [2019-12-27 20:55:29,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:29,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:29,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1502747092] [2019-12-27 20:55:29,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:29,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:29,497 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:55:29,497 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:29,514 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:29,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:29,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:29,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:29,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:29,515 INFO L87 Difference]: Start difference. First operand 1672 states and 4077 transitions. Second operand 5 states. [2019-12-27 20:55:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:29,705 INFO L93 Difference]: Finished difference Result 2061 states and 4940 transitions. [2019-12-27 20:55:29,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:55:29,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:55:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:29,717 INFO L225 Difference]: With dead ends: 2061 [2019-12-27 20:55:29,717 INFO L226 Difference]: Without dead ends: 2061 [2019-12-27 20:55:29,718 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 20:55:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2019-12-27 20:55:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1689. [2019-12-27 20:55:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2019-12-27 20:55:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 4121 transitions. [2019-12-27 20:55:29,820 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 4121 transitions. Word has length 14 [2019-12-27 20:55:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:29,820 INFO L462 AbstractCegarLoop]: Abstraction has 1689 states and 4121 transitions. [2019-12-27 20:55:29,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 4121 transitions. [2019-12-27 20:55:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:55:29,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:29,823 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] [2019-12-27 20:55:29,824 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash 266256386, now seen corresponding path program 1 times [2019-12-27 20:55:29,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:29,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797258712] [2019-12-27 20:55:29,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:29,907 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 20:55:29,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797258712] [2019-12-27 20:55:29,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:29,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:29,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [159453776] [2019-12-27 20:55:29,909 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:29,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:29,928 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 20:55:29,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:29,944 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:29,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:29,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:29,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:29,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:29,945 INFO L87 Difference]: Start difference. First operand 1689 states and 4121 transitions. Second operand 5 states. [2019-12-27 20:55:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:29,972 INFO L93 Difference]: Finished difference Result 735 states and 1676 transitions. [2019-12-27 20:55:29,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:55:29,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:55:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:29,976 INFO L225 Difference]: With dead ends: 735 [2019-12-27 20:55:29,976 INFO L226 Difference]: Without dead ends: 735 [2019-12-27 20:55:29,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-12-27 20:55:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 715. [2019-12-27 20:55:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-12-27 20:55:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1636 transitions. [2019-12-27 20:55:29,993 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1636 transitions. Word has length 26 [2019-12-27 20:55:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:29,994 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1636 transitions. [2019-12-27 20:55:29,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1636 transitions. [2019-12-27 20:55:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:55:29,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:29,996 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 20:55:29,997 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:29,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:29,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1261986746, now seen corresponding path program 1 times [2019-12-27 20:55:29,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:29,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975503362] [2019-12-27 20:55:29,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:30,079 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 20:55:30,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975503362] [2019-12-27 20:55:30,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:30,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:30,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [586495011] [2019-12-27 20:55:30,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:30,092 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:30,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 115 transitions. [2019-12-27 20:55:30,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:30,129 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:30,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:55:30,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:30,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:55:30,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:30,130 INFO L87 Difference]: Start difference. First operand 715 states and 1636 transitions. Second operand 4 states. [2019-12-27 20:55:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:30,149 INFO L93 Difference]: Finished difference Result 1135 states and 2642 transitions. [2019-12-27 20:55:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:55:30,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 20:55:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:30,153 INFO L225 Difference]: With dead ends: 1135 [2019-12-27 20:55:30,153 INFO L226 Difference]: Without dead ends: 439 [2019-12-27 20:55:30,153 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 20:55:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-12-27 20:55:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-12-27 20:55:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-12-27 20:55:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1037 transitions. [2019-12-27 20:55:30,164 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1037 transitions. Word has length 41 [2019-12-27 20:55:30,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:30,164 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 1037 transitions. [2019-12-27 20:55:30,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:55:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1037 transitions. [2019-12-27 20:55:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:55:30,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:30,166 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 20:55:30,167 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:30,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:30,167 INFO L82 PathProgramCache]: Analyzing trace with hash 798425448, now seen corresponding path program 2 times [2019-12-27 20:55:30,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:30,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129984971] [2019-12-27 20:55:30,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:30,291 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 20:55:30,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129984971] [2019-12-27 20:55:30,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:30,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:55:30,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [428440435] [2019-12-27 20:55:30,292 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:30,302 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:30,330 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 76 transitions. [2019-12-27 20:55:30,330 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:30,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:55:30,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:55:30,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:30,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:55:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:55:30,345 INFO L87 Difference]: Start difference. First operand 439 states and 1037 transitions. Second operand 7 states. [2019-12-27 20:55:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:30,553 INFO L93 Difference]: Finished difference Result 844 states and 1939 transitions. [2019-12-27 20:55:30,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:55:30,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 20:55:30,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:30,556 INFO L225 Difference]: With dead ends: 844 [2019-12-27 20:55:30,557 INFO L226 Difference]: Without dead ends: 548 [2019-12-27 20:55:30,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:55:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-12-27 20:55:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 488. [2019-12-27 20:55:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-12-27 20:55:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1120 transitions. [2019-12-27 20:55:30,568 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1120 transitions. Word has length 41 [2019-12-27 20:55:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:30,568 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 1120 transitions. [2019-12-27 20:55:30,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:55:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1120 transitions. [2019-12-27 20:55:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:55:30,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:30,570 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 20:55:30,570 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:30,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:30,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1598750312, now seen corresponding path program 3 times [2019-12-27 20:55:30,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:30,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874712936] [2019-12-27 20:55:30,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:30,689 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 20:55:30,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874712936] [2019-12-27 20:55:30,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:30,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:55:30,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932397148] [2019-12-27 20:55:30,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:30,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:30,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 101 transitions. [2019-12-27 20:55:30,731 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:30,749 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:55:30,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:55:30,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:30,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:55:30,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:55:30,750 INFO L87 Difference]: Start difference. First operand 488 states and 1120 transitions. Second operand 6 states. [2019-12-27 20:55:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:31,231 INFO L93 Difference]: Finished difference Result 830 states and 1839 transitions. [2019-12-27 20:55:31,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:55:31,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 20:55:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:31,236 INFO L225 Difference]: With dead ends: 830 [2019-12-27 20:55:31,237 INFO L226 Difference]: Without dead ends: 818 [2019-12-27 20:55:31,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:55:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-27 20:55:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 774. [2019-12-27 20:55:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-12-27 20:55:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1733 transitions. [2019-12-27 20:55:31,256 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1733 transitions. Word has length 41 [2019-12-27 20:55:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:31,256 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1733 transitions. [2019-12-27 20:55:31,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:55:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1733 transitions. [2019-12-27 20:55:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:55:31,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:31,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:31,259 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:31,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:31,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2012611512, now seen corresponding path program 4 times [2019-12-27 20:55:31,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:31,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206207445] [2019-12-27 20:55:31,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:31,319 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 20:55:31,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206207445] [2019-12-27 20:55:31,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:31,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:31,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130342729] [2019-12-27 20:55:31,320 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:31,329 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:31,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 86 transitions. [2019-12-27 20:55:31,358 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:31,358 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:31,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:31,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:31,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:31,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:31,359 INFO L87 Difference]: Start difference. First operand 774 states and 1733 transitions. Second operand 3 states. [2019-12-27 20:55:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:31,374 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-27 20:55:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:31,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 20:55:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:31,379 INFO L225 Difference]: With dead ends: 772 [2019-12-27 20:55:31,380 INFO L226 Difference]: Without dead ends: 772 [2019-12-27 20:55:31,380 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 20:55:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-27 20:55:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 707. [2019-12-27 20:55:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-27 20:55:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1604 transitions. [2019-12-27 20:55:31,399 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1604 transitions. Word has length 41 [2019-12-27 20:55:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:31,401 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1604 transitions. [2019-12-27 20:55:31,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1604 transitions. [2019-12-27 20:55:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:55:31,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:31,403 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 20:55:31,403 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1633589471, now seen corresponding path program 1 times [2019-12-27 20:55:31,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:31,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836063558] [2019-12-27 20:55:31,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:55:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:55:31,522 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:55:31,522 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:55:31,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_24|) |v_ULTIMATE.start_main_~#t843~0.offset_19| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff1_thd1~0_42) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 v_~y$w_buff1~0_24) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~z~0_11 0) (= |v_#NULL.offset_3| 0) (= v_~y$read_delayed~0_8 0) (= |v_ULTIMATE.start_main_~#t843~0.offset_19| 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= v_~y$r_buff0_thd2~0_29 0) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$w_buff1_used~0_57 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t843~0.base_24|)) (= 0 v_~y$w_buff0_used~0_92) (= 0 v_~y$r_buff1_thd2~0_19) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t843~0.base_24|) (< 0 |v_#StackHeapBarrier_14|) (= v_~y~0_22 0) (= v_~y$r_buff0_thd0~0_21 0) (= |v_#valid_40| (store .cse0 |v_ULTIMATE.start_main_~#t843~0.base_24| 1)) (= v_~y$r_buff0_thd1~0_69 0) (= 0 v_~y$w_buff0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t843~0.base_24| 4)) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~a~0_12 0) (= v_~y$mem_tmp~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_cnt~0_18) (= 0 v_~weak$$choice2~0_31) (= v_~__unbuffered_p0_EBX~0_17 0) (= v_~__unbuffered_p1_EBX~0_18 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_18|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_42, ~a~0=v_~a~0_12, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_~#t843~0.base=|v_ULTIMATE.start_main_~#t843~0.base_24|, ~y$w_buff0~0=v_~y$w_buff0~0_24, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_69, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_15|, ~y~0=v_~y~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_22|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_40|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~z~0=v_~z~0_11, ULTIMATE.start_main_~#t843~0.offset=|v_ULTIMATE.start_main_~#t843~0.offset_19|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_9, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t844~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t843~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t844~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t843~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:55:31,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t844~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t844~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t844~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12|) |v_ULTIMATE.start_main_~#t844~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t844~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t844~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t844~0.base] because there is no mapped edge [2019-12-27 20:55:31,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L5-->L787: Formula: (and (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1172775723)) (= ~z~0_Out-1172775723 1) (= ~y$r_buff0_thd2~0_Out-1172775723 1) (= ~y$r_buff1_thd0~0_Out-1172775723 ~y$r_buff0_thd0~0_In-1172775723) (= ~z~0_Out-1172775723 ~__unbuffered_p1_EAX~0_Out-1172775723) (= ~y$r_buff1_thd2~0_Out-1172775723 ~y$r_buff0_thd2~0_In-1172775723) (= ~__unbuffered_p1_EBX~0_Out-1172775723 ~a~0_In-1172775723) (= ~y$r_buff0_thd1~0_In-1172775723 ~y$r_buff1_thd1~0_Out-1172775723)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1172775723, ~a~0=~a~0_In-1172775723, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1172775723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1172775723, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1172775723} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1172775723, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1172775723, ~a~0=~a~0_In-1172775723, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1172775723, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1172775723, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1172775723, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1172775723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1172775723, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1172775723, ~z~0=~z~0_Out-1172775723, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1172775723} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:55:31,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1402951623 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1402951623 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1402951623| ~y$w_buff0_used~0_In-1402951623)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-1402951623| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1402951623, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1402951623} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1402951623, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1402951623, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1402951623|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:55:31,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-568390741 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-568390741 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-568390741 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-568390741 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite29_Out-568390741| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite29_Out-568390741| ~y$w_buff1_used~0_In-568390741) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-568390741, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-568390741, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-568390741, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-568390741} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-568390741, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-568390741|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-568390741, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-568390741, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-568390741} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 20:55:31,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_44 v_~y$r_buff0_thd1~0_43) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_9|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_43, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 20:55:31,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L752-->L752-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1699323112 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1699323112 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In1699323112 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In1699323112 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1699323112 256))))) .cse1 (= |P0Thread1of1ForFork0_#t~ite23_Out1699323112| |P0Thread1of1ForFork0_#t~ite24_Out1699323112|) (= ~y$r_buff1_thd1~0_In1699323112 |P0Thread1of1ForFork0_#t~ite23_Out1699323112|)) (and (not .cse1) (= ~y$r_buff1_thd1~0_In1699323112 |P0Thread1of1ForFork0_#t~ite24_Out1699323112|) (= |P0Thread1of1ForFork0_#t~ite23_In1699323112| |P0Thread1of1ForFork0_#t~ite23_Out1699323112|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1699323112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1699323112, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1699323112, ~weak$$choice2~0=~weak$$choice2~0_In1699323112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1699323112, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In1699323112|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1699323112, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1699323112, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1699323112, ~weak$$choice2~0=~weak$$choice2~0_In1699323112, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out1699323112|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out1699323112|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1699323112} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 20:55:31,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= v_~y~0_15 v_~y$mem_tmp~0_4) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 20:55:31,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2117484464 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2117484464 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out-2117484464)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-2117484464 ~y$r_buff0_thd2~0_Out-2117484464)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2117484464, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2117484464} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2117484464|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2117484464, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2117484464} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:55:31,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-280357758 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-280357758 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-280357758 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-280357758 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-280357758 |P1Thread1of1ForFork1_#t~ite31_Out-280357758|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out-280357758|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-280357758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-280357758, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-280357758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-280357758} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-280357758, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-280357758, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-280357758|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-280357758, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-280357758} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 20:55:31,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L791-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 20:55:31,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:55:31,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-238858091 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-238858091 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-238858091 |ULTIMATE.start_main_#t~ite34_Out-238858091|)) (and (or .cse1 .cse0) (= ~y~0_In-238858091 |ULTIMATE.start_main_#t~ite34_Out-238858091|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-238858091, ~y~0=~y~0_In-238858091, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-238858091, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-238858091} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-238858091, ~y~0=~y~0_In-238858091, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-238858091, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-238858091|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-238858091} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 20:55:31,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite34_8|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 20:55:31,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-794160970 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-794160970 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-794160970| 0)) (and (= |ULTIMATE.start_main_#t~ite36_Out-794160970| ~y$w_buff0_used~0_In-794160970) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-794160970, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-794160970} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-794160970, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-794160970, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-794160970|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 20:55:31,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1789494472 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1789494472 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1789494472 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1789494472 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1789494472 |ULTIMATE.start_main_#t~ite37_Out1789494472|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out1789494472|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1789494472, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1789494472, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1789494472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1789494472} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1789494472, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1789494472, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1789494472|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1789494472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1789494472} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 20:55:31,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2100857492 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2100857492 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out-2100857492|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-2100857492| ~y$r_buff0_thd0~0_In-2100857492)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100857492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2100857492} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100857492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2100857492, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2100857492|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 20:55:31,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-538720864 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-538720864 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-538720864 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-538720864 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In-538720864 |ULTIMATE.start_main_#t~ite39_Out-538720864|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite39_Out-538720864| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-538720864, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-538720864, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-538720864, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-538720864} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-538720864, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-538720864|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-538720864, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-538720864, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-538720864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 20:55:31,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_16) (= 1 v_~__unbuffered_p1_EAX~0_10) (= v_~__unbuffered_p1_EBX~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 1) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:55:31,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:55:31 BasicIcfg [2019-12-27 20:55:31,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:55:31,684 INFO L168 Benchmark]: Toolchain (without parser) took 10394.49 ms. Allocated memory was 145.2 MB in the beginning and 375.4 MB in the end (delta: 230.2 MB). Free memory was 100.0 MB in the beginning and 293.9 MB in the end (delta: -193.9 MB). Peak memory consumption was 266.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:31,685 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:55:31,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 846.85 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.6 MB in the beginning and 156.4 MB in the end (delta: -56.9 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:31,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.96 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:31,687 INFO L168 Benchmark]: Boogie Preprocessor took 35.64 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:31,688 INFO L168 Benchmark]: RCFGBuilder took 750.80 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 110.0 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:31,689 INFO L168 Benchmark]: TraceAbstraction took 8696.84 ms. Allocated memory was 203.4 MB in the beginning and 375.4 MB in the end (delta: 172.0 MB). Free memory was 110.0 MB in the beginning and 293.9 MB in the end (delta: -183.9 MB). Peak memory consumption was 217.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:31,693 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 846.85 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.6 MB in the beginning and 156.4 MB in the end (delta: -56.9 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.96 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.64 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 750.80 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 110.0 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8696.84 ms. Allocated memory was 203.4 MB in the beginning and 375.4 MB in the end (delta: 172.0 MB). Free memory was 110.0 MB in the beginning and 293.9 MB in the end (delta: -183.9 MB). Peak memory consumption was 217.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 139 ProgramPointsBefore, 68 ProgramPointsAfterwards, 167 TransitionsBefore, 79 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 20 ChoiceCompositions, 4338 VarBasedMoverChecksPositive, 128 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 46171 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t843, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t844, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L818] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.3s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1042 SDtfs, 778 SDslu, 1940 SDs, 0 SdLazy, 863 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6786occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1209 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 25542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...