/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/mix047_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:22:44,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:22:44,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:22:44,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:22:44,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:22:44,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:22:44,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:22:44,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:22:44,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:22:45,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:22:45,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:22:45,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:22:45,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:22:45,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:22:45,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:22:45,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:22:45,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:22:45,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:22:45,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:22:45,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:22:45,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:22:45,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:22:45,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:22:45,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:22:45,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:22:45,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:22:45,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:22:45,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:22:45,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:22:45,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:22:45,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:22:45,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:22:45,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:22:45,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:22:45,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:22:45,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:22:45,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:22:45,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:22:45,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:22:45,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:22:45,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:22:45,055 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 21:22:45,075 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:22:45,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:22:45,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:22:45,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:22:45,077 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:22:45,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:22:45,078 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:22:45,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:22:45,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:22:45,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:22:45,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:22:45,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:22:45,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:22:45,079 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:22:45,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:22:45,080 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:22:45,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:22:45,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:22:45,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:22:45,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:22:45,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:22:45,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:22:45,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:22:45,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:22:45,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:22:45,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:22:45,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:22:45,082 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:22:45,082 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:22:45,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:22:45,083 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:22:45,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:22:45,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:22:45,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:22:45,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:22:45,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:22:45,374 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:22:45,375 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2019-12-27 21:22:45,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51538a148/f5fd5d4dfce44bfc87829ba1956d2a56/FLAGabd97cedf [2019-12-27 21:22:46,042 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:22:46,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2019-12-27 21:22:46,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51538a148/f5fd5d4dfce44bfc87829ba1956d2a56/FLAGabd97cedf [2019-12-27 21:22:46,268 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51538a148/f5fd5d4dfce44bfc87829ba1956d2a56 [2019-12-27 21:22:46,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:22:46,284 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:22:46,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:22:46,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:22:46,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:22:46,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:22:46" (1/1) ... [2019-12-27 21:22:46,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166c5411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:46, skipping insertion in model container [2019-12-27 21:22:46,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:22:46" (1/1) ... [2019-12-27 21:22:46,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:22:46,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:22:46,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:22:46,892 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:22:47,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:22:47,072 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:22:47,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47 WrapperNode [2019-12-27 21:22:47,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:22:47,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:22:47,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:22:47,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:22:47,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47" (1/1) ... [2019-12-27 21:22:47,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47" (1/1) ... [2019-12-27 21:22:47,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:22:47,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:22:47,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:22:47,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:22:47,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47" (1/1) ... [2019-12-27 21:22:47,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47" (1/1) ... [2019-12-27 21:22:47,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47" (1/1) ... [2019-12-27 21:22:47,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47" (1/1) ... [2019-12-27 21:22:47,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47" (1/1) ... [2019-12-27 21:22:47,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47" (1/1) ... [2019-12-27 21:22:47,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47" (1/1) ... [2019-12-27 21:22:47,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:22:47,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:22:47,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:22:47,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:22:47,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47" (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 21:22:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:22:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:22:47,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:22:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:22:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:22:47,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:22:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:22:47,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:22:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:22:47,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:22:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:22:47,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:22:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:22:47,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:22:47,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:22:47,253 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 21:22:48,028 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:22:48,028 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:22:48,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:22:48 BoogieIcfgContainer [2019-12-27 21:22:48,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:22:48,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:22:48,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:22:48,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:22:48,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:22:46" (1/3) ... [2019-12-27 21:22:48,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6066a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:22:48, skipping insertion in model container [2019-12-27 21:22:48,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:22:47" (2/3) ... [2019-12-27 21:22:48,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6066a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:22:48, skipping insertion in model container [2019-12-27 21:22:48,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:22:48" (3/3) ... [2019-12-27 21:22:48,038 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_power.opt.i [2019-12-27 21:22:48,049 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:22:48,049 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:22:48,057 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:22:48,058 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:22:48,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,109 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,109 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,111 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,111 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,112 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,125 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,125 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,126 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,126 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,126 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,126 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,127 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,127 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,127 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,128 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,128 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,128 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,128 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,128 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,146 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,146 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,147 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,147 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,147 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,147 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,147 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,148 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,148 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,148 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,148 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,149 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,149 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,149 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,150 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,150 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,150 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,150 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,151 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,156 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,157 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,158 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,162 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,172 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,172 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,174 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,174 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,175 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:22:48,189 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:22:48,207 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:22:48,207 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:22:48,207 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:22:48,208 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:22:48,208 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:22:48,208 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:22:48,208 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:22:48,208 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:22:48,221 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 21:22:48,223 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 21:22:48,344 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 21:22:48,344 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:22:48,358 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:22:48,379 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 21:22:48,428 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 21:22:48,428 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:22:48,435 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:22:48,450 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 21:22:48,451 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:22:51,985 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 21:22:52,136 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 21:22:52,187 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52826 [2019-12-27 21:22:52,187 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 21:22:52,190 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-27 21:22:55,470 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 38654 states. [2019-12-27 21:22:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 38654 states. [2019-12-27 21:22:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:22:55,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:22:55,480 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:22:55,480 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:22:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:22:55,486 INFO L82 PathProgramCache]: Analyzing trace with hash -313660218, now seen corresponding path program 1 times [2019-12-27 21:22:55,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:22:55,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53379897] [2019-12-27 21:22:55,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:22:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:22:55,780 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 21:22:55,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53379897] [2019-12-27 21:22:55,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:22:55,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:22:55,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [712589902] [2019-12-27 21:22:55,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:22:55,793 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:22:55,812 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:22:55,812 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:22:55,817 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:22:55,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:22:55,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:22:55,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:22:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:22:55,835 INFO L87 Difference]: Start difference. First operand 38654 states. Second operand 3 states. [2019-12-27 21:22:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:22:56,589 INFO L93 Difference]: Finished difference Result 36046 states and 153176 transitions. [2019-12-27 21:22:56,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:22:56,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:22:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:22:56,850 INFO L225 Difference]: With dead ends: 36046 [2019-12-27 21:22:56,850 INFO L226 Difference]: Without dead ends: 35318 [2019-12-27 21:22:56,851 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 21:22:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35318 states. [2019-12-27 21:22:58,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35318 to 35318. [2019-12-27 21:22:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35318 states. [2019-12-27 21:23:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35318 states to 35318 states and 150208 transitions. [2019-12-27 21:23:00,426 INFO L78 Accepts]: Start accepts. Automaton has 35318 states and 150208 transitions. Word has length 9 [2019-12-27 21:23:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:00,427 INFO L462 AbstractCegarLoop]: Abstraction has 35318 states and 150208 transitions. [2019-12-27 21:23:00,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:23:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35318 states and 150208 transitions. [2019-12-27 21:23:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:23:00,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:00,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:00,437 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:00,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1224255535, now seen corresponding path program 1 times [2019-12-27 21:23:00,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:00,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490996927] [2019-12-27 21:23:00,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:00,581 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 21:23:00,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490996927] [2019-12-27 21:23:00,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:00,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:23:00,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [433126635] [2019-12-27 21:23:00,584 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:00,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:00,594 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 21:23:00,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:00,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:23:00,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:23:00,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:00,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:23:00,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:23:00,638 INFO L87 Difference]: Start difference. First operand 35318 states and 150208 transitions. Second operand 5 states. [2019-12-27 21:23:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:01,972 INFO L93 Difference]: Finished difference Result 54990 states and 226052 transitions. [2019-12-27 21:23:01,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:23:01,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 21:23:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:02,686 INFO L225 Difference]: With dead ends: 54990 [2019-12-27 21:23:02,687 INFO L226 Difference]: Without dead ends: 54962 [2019-12-27 21:23:02,688 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 21:23:03,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54962 states. [2019-12-27 21:23:04,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54962 to 50002. [2019-12-27 21:23:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50002 states. [2019-12-27 21:23:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50002 states to 50002 states and 207548 transitions. [2019-12-27 21:23:04,841 INFO L78 Accepts]: Start accepts. Automaton has 50002 states and 207548 transitions. Word has length 15 [2019-12-27 21:23:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:04,841 INFO L462 AbstractCegarLoop]: Abstraction has 50002 states and 207548 transitions. [2019-12-27 21:23:04,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:23:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 50002 states and 207548 transitions. [2019-12-27 21:23:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:23:04,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:04,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:04,852 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:04,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:04,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1764776836, now seen corresponding path program 1 times [2019-12-27 21:23:04,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:04,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139695277] [2019-12-27 21:23:04,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:04,919 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 21:23:04,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139695277] [2019-12-27 21:23:04,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:04,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:23:04,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83403576] [2019-12-27 21:23:04,923 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:04,924 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:04,926 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:23:04,927 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:04,927 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:23:04,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:23:04,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:04,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:23:04,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:23:04,928 INFO L87 Difference]: Start difference. First operand 50002 states and 207548 transitions. Second operand 3 states. [2019-12-27 21:23:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:06,735 INFO L93 Difference]: Finished difference Result 39218 states and 150397 transitions. [2019-12-27 21:23:06,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:23:06,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:23:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:06,874 INFO L225 Difference]: With dead ends: 39218 [2019-12-27 21:23:06,875 INFO L226 Difference]: Without dead ends: 39218 [2019-12-27 21:23:06,875 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 21:23:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39218 states. [2019-12-27 21:23:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39218 to 39218. [2019-12-27 21:23:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39218 states. [2019-12-27 21:23:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39218 states to 39218 states and 150397 transitions. [2019-12-27 21:23:08,102 INFO L78 Accepts]: Start accepts. Automaton has 39218 states and 150397 transitions. Word has length 15 [2019-12-27 21:23:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:08,102 INFO L462 AbstractCegarLoop]: Abstraction has 39218 states and 150397 transitions. [2019-12-27 21:23:08,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:23:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 39218 states and 150397 transitions. [2019-12-27 21:23:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:23:08,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:08,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:08,105 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1883411785, now seen corresponding path program 1 times [2019-12-27 21:23:08,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:08,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958757517] [2019-12-27 21:23:08,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:08,186 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 21:23:08,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958757517] [2019-12-27 21:23:08,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:08,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:23:08,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [48501140] [2019-12-27 21:23:08,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:08,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:08,193 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:23:08,193 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:08,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:23:08,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:23:08,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:08,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:23:08,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:23:08,215 INFO L87 Difference]: Start difference. First operand 39218 states and 150397 transitions. Second operand 5 states. [2019-12-27 21:23:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:08,325 INFO L93 Difference]: Finished difference Result 16304 states and 51852 transitions. [2019-12-27 21:23:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:23:08,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:23:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:08,362 INFO L225 Difference]: With dead ends: 16304 [2019-12-27 21:23:08,362 INFO L226 Difference]: Without dead ends: 16304 [2019-12-27 21:23:08,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:23:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2019-12-27 21:23:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 16304. [2019-12-27 21:23:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16304 states. [2019-12-27 21:23:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16304 states to 16304 states and 51852 transitions. [2019-12-27 21:23:08,758 INFO L78 Accepts]: Start accepts. Automaton has 16304 states and 51852 transitions. Word has length 16 [2019-12-27 21:23:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:08,759 INFO L462 AbstractCegarLoop]: Abstraction has 16304 states and 51852 transitions. [2019-12-27 21:23:08,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:23:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 16304 states and 51852 transitions. [2019-12-27 21:23:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:23:08,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:08,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:08,761 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:08,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:08,761 INFO L82 PathProgramCache]: Analyzing trace with hash 471912602, now seen corresponding path program 1 times [2019-12-27 21:23:08,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:08,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559987517] [2019-12-27 21:23:08,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:08,977 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 21:23:08,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559987517] [2019-12-27 21:23:08,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:08,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:23:08,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [607795897] [2019-12-27 21:23:08,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:08,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:08,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:23:08,985 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:09,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:23:09,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:23:09,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:09,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:23:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:23:09,003 INFO L87 Difference]: Start difference. First operand 16304 states and 51852 transitions. Second operand 6 states. [2019-12-27 21:23:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:09,055 INFO L93 Difference]: Finished difference Result 2786 states and 7200 transitions. [2019-12-27 21:23:09,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:23:09,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 21:23:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:09,061 INFO L225 Difference]: With dead ends: 2786 [2019-12-27 21:23:09,061 INFO L226 Difference]: Without dead ends: 2786 [2019-12-27 21:23:09,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:23:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2019-12-27 21:23:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786. [2019-12-27 21:23:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2019-12-27 21:23:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 7200 transitions. [2019-12-27 21:23:09,090 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 7200 transitions. Word has length 17 [2019-12-27 21:23:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:09,090 INFO L462 AbstractCegarLoop]: Abstraction has 2786 states and 7200 transitions. [2019-12-27 21:23:09,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:23:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 7200 transitions. [2019-12-27 21:23:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:23:09,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:09,094 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] [2019-12-27 21:23:09,094 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:09,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:09,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1539396208, now seen corresponding path program 1 times [2019-12-27 21:23:09,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:09,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487952046] [2019-12-27 21:23:09,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:09,169 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 21:23:09,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487952046] [2019-12-27 21:23:09,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:09,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:23:09,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [947245498] [2019-12-27 21:23:09,170 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:09,175 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:09,206 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 21:23:09,206 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:09,262 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:23:09,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:23:09,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:09,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:23:09,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:23:09,264 INFO L87 Difference]: Start difference. First operand 2786 states and 7200 transitions. Second operand 8 states. [2019-12-27 21:23:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:09,323 INFO L93 Difference]: Finished difference Result 1356 states and 3887 transitions. [2019-12-27 21:23:09,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:23:09,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 21:23:09,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:09,327 INFO L225 Difference]: With dead ends: 1356 [2019-12-27 21:23:09,327 INFO L226 Difference]: Without dead ends: 1356 [2019-12-27 21:23:09,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:23:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-12-27 21:23:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1216. [2019-12-27 21:23:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-12-27 21:23:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3487 transitions. [2019-12-27 21:23:09,349 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3487 transitions. Word has length 29 [2019-12-27 21:23:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:09,349 INFO L462 AbstractCegarLoop]: Abstraction has 1216 states and 3487 transitions. [2019-12-27 21:23:09,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:23:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3487 transitions. [2019-12-27 21:23:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:23:09,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:09,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:09,353 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1329665717, now seen corresponding path program 1 times [2019-12-27 21:23:09,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:09,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899760806] [2019-12-27 21:23:09,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:09,444 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 21:23:09,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899760806] [2019-12-27 21:23:09,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:09,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:23:09,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1183334360] [2019-12-27 21:23:09,445 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:09,468 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:09,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:23:09,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:09,571 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:23:09,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:23:09,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:09,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:23:09,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:23:09,572 INFO L87 Difference]: Start difference. First operand 1216 states and 3487 transitions. Second operand 3 states. [2019-12-27 21:23:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:09,625 INFO L93 Difference]: Finished difference Result 1224 states and 3495 transitions. [2019-12-27 21:23:09,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:23:09,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:23:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:09,629 INFO L225 Difference]: With dead ends: 1224 [2019-12-27 21:23:09,629 INFO L226 Difference]: Without dead ends: 1224 [2019-12-27 21:23:09,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:23:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-12-27 21:23:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2019-12-27 21:23:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2019-12-27 21:23:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3490 transitions. [2019-12-27 21:23:09,650 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3490 transitions. Word has length 58 [2019-12-27 21:23:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:09,653 INFO L462 AbstractCegarLoop]: Abstraction has 1219 states and 3490 transitions. [2019-12-27 21:23:09,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:23:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3490 transitions. [2019-12-27 21:23:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:23:09,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:09,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:09,657 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1606563127, now seen corresponding path program 1 times [2019-12-27 21:23:09,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:09,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165662758] [2019-12-27 21:23:09,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:09,818 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 21:23:09,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165662758] [2019-12-27 21:23:09,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:09,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:23:09,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2051982565] [2019-12-27 21:23:09,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:09,837 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:09,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:23:09,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:09,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:23:09,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:23:09,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:23:09,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:23:09,948 INFO L87 Difference]: Start difference. First operand 1219 states and 3490 transitions. Second operand 5 states. [2019-12-27 21:23:10,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:10,165 INFO L93 Difference]: Finished difference Result 1760 states and 5012 transitions. [2019-12-27 21:23:10,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:23:10,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:23:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:10,170 INFO L225 Difference]: With dead ends: 1760 [2019-12-27 21:23:10,170 INFO L226 Difference]: Without dead ends: 1760 [2019-12-27 21:23:10,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:23:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-12-27 21:23:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1415. [2019-12-27 21:23:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-12-27 21:23:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4066 transitions. [2019-12-27 21:23:10,188 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 4066 transitions. Word has length 58 [2019-12-27 21:23:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:10,189 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 4066 transitions. [2019-12-27 21:23:10,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:23:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 4066 transitions. [2019-12-27 21:23:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:23:10,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:10,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:10,192 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:10,193 INFO L82 PathProgramCache]: Analyzing trace with hash 595510245, now seen corresponding path program 2 times [2019-12-27 21:23:10,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:10,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620295641] [2019-12-27 21:23:10,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:10,312 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 21:23:10,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620295641] [2019-12-27 21:23:10,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:10,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:23:10,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1273034378] [2019-12-27 21:23:10,313 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:10,331 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:10,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 231 transitions. [2019-12-27 21:23:10,452 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:10,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:23:10,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:23:10,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:23:10,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:23:10,552 INFO L87 Difference]: Start difference. First operand 1415 states and 4066 transitions. Second operand 10 states. [2019-12-27 21:23:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:11,961 INFO L93 Difference]: Finished difference Result 3057 states and 8420 transitions. [2019-12-27 21:23:11,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:23:11,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 21:23:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:11,967 INFO L225 Difference]: With dead ends: 3057 [2019-12-27 21:23:11,967 INFO L226 Difference]: Without dead ends: 3057 [2019-12-27 21:23:11,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:23:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2019-12-27 21:23:11,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 1499. [2019-12-27 21:23:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-12-27 21:23:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 4314 transitions. [2019-12-27 21:23:11,996 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 4314 transitions. Word has length 58 [2019-12-27 21:23:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:11,997 INFO L462 AbstractCegarLoop]: Abstraction has 1499 states and 4314 transitions. [2019-12-27 21:23:11,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:23:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 4314 transitions. [2019-12-27 21:23:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:23:12,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:12,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:12,001 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1233712533, now seen corresponding path program 3 times [2019-12-27 21:23:12,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:12,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350813248] [2019-12-27 21:23:12,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:12,129 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 21:23:12,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350813248] [2019-12-27 21:23:12,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:12,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:23:12,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1470052771] [2019-12-27 21:23:12,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:12,148 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:12,220 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 204 transitions. [2019-12-27 21:23:12,221 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:12,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:23:12,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:23:12,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:12,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:23:12,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:23:12,239 INFO L87 Difference]: Start difference. First operand 1499 states and 4314 transitions. Second operand 7 states. [2019-12-27 21:23:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:12,318 INFO L93 Difference]: Finished difference Result 2139 states and 5825 transitions. [2019-12-27 21:23:12,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:23:12,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-27 21:23:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:12,321 INFO L225 Difference]: With dead ends: 2139 [2019-12-27 21:23:12,321 INFO L226 Difference]: Without dead ends: 1369 [2019-12-27 21:23:12,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:23:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-12-27 21:23:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369. [2019-12-27 21:23:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2019-12-27 21:23:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 3874 transitions. [2019-12-27 21:23:12,337 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 3874 transitions. Word has length 58 [2019-12-27 21:23:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:12,337 INFO L462 AbstractCegarLoop]: Abstraction has 1369 states and 3874 transitions. [2019-12-27 21:23:12,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:23:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 3874 transitions. [2019-12-27 21:23:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:23:12,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:12,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:12,340 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:12,341 INFO L82 PathProgramCache]: Analyzing trace with hash 557732435, now seen corresponding path program 4 times [2019-12-27 21:23:12,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:12,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988733273] [2019-12-27 21:23:12,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:12,442 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 21:23:12,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988733273] [2019-12-27 21:23:12,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:12,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:23:12,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1672757725] [2019-12-27 21:23:12,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:12,461 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:12,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 250 transitions. [2019-12-27 21:23:12,644 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:12,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:23:12,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:23:12,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:12,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:23:12,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:23:12,660 INFO L87 Difference]: Start difference. First operand 1369 states and 3874 transitions. Second operand 6 states. [2019-12-27 21:23:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:12,984 INFO L93 Difference]: Finished difference Result 2227 states and 6256 transitions. [2019-12-27 21:23:12,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:23:12,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 21:23:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:12,989 INFO L225 Difference]: With dead ends: 2227 [2019-12-27 21:23:12,989 INFO L226 Difference]: Without dead ends: 2227 [2019-12-27 21:23:12,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:23:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2019-12-27 21:23:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1541. [2019-12-27 21:23:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1541 states. [2019-12-27 21:23:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 4364 transitions. [2019-12-27 21:23:13,021 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 4364 transitions. Word has length 58 [2019-12-27 21:23:13,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:13,021 INFO L462 AbstractCegarLoop]: Abstraction has 1541 states and 4364 transitions. [2019-12-27 21:23:13,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:23:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 4364 transitions. [2019-12-27 21:23:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:23:13,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:13,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:13,026 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:13,026 INFO L82 PathProgramCache]: Analyzing trace with hash 31711405, now seen corresponding path program 5 times [2019-12-27 21:23:13,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:13,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93367136] [2019-12-27 21:23:13,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:13,097 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 21:23:13,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93367136] [2019-12-27 21:23:13,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:13,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:23:13,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417544537] [2019-12-27 21:23:13,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:13,134 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:13,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 301 transitions. [2019-12-27 21:23:13,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:13,318 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:23:13,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:23:13,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:13,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:23:13,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:23:13,320 INFO L87 Difference]: Start difference. First operand 1541 states and 4364 transitions. Second operand 5 states. [2019-12-27 21:23:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:13,498 INFO L93 Difference]: Finished difference Result 1755 states and 4839 transitions. [2019-12-27 21:23:13,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:23:13,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:23:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:13,501 INFO L225 Difference]: With dead ends: 1755 [2019-12-27 21:23:13,501 INFO L226 Difference]: Without dead ends: 1755 [2019-12-27 21:23:13,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:23:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2019-12-27 21:23:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1357. [2019-12-27 21:23:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-12-27 21:23:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 3766 transitions. [2019-12-27 21:23:13,525 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 3766 transitions. Word has length 58 [2019-12-27 21:23:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:13,525 INFO L462 AbstractCegarLoop]: Abstraction has 1357 states and 3766 transitions. [2019-12-27 21:23:13,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:23:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 3766 transitions. [2019-12-27 21:23:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:23:13,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:13,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:13,529 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1795474320, now seen corresponding path program 1 times [2019-12-27 21:23:13,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:13,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447470554] [2019-12-27 21:23:13,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:13,677 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 21:23:13,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447470554] [2019-12-27 21:23:13,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:13,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:23:13,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1067950479] [2019-12-27 21:23:13,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:13,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:13,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 213 transitions. [2019-12-27 21:23:13,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:13,826 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:23:13,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:23:13,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:13,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:23:13,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:23:13,828 INFO L87 Difference]: Start difference. First operand 1357 states and 3766 transitions. Second operand 7 states. [2019-12-27 21:23:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:14,116 INFO L93 Difference]: Finished difference Result 2958 states and 7518 transitions. [2019-12-27 21:23:14,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:23:14,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 21:23:14,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:14,120 INFO L225 Difference]: With dead ends: 2958 [2019-12-27 21:23:14,120 INFO L226 Difference]: Without dead ends: 1666 [2019-12-27 21:23:14,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:23:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2019-12-27 21:23:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 999. [2019-12-27 21:23:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-27 21:23:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2439 transitions. [2019-12-27 21:23:14,135 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2439 transitions. Word has length 59 [2019-12-27 21:23:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:14,135 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 2439 transitions. [2019-12-27 21:23:14,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:23:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2439 transitions. [2019-12-27 21:23:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:23:14,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:14,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:14,137 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash 745066166, now seen corresponding path program 2 times [2019-12-27 21:23:14,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:14,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033230001] [2019-12-27 21:23:14,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:14,197 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 21:23:14,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033230001] [2019-12-27 21:23:14,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:14,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:23:14,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [926410659] [2019-12-27 21:23:14,199 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:14,233 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:14,340 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 222 transitions. [2019-12-27 21:23:14,341 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:14,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:23:14,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:23:14,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:14,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:23:14,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:23:14,343 INFO L87 Difference]: Start difference. First operand 999 states and 2439 transitions. Second operand 3 states. [2019-12-27 21:23:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:14,406 INFO L93 Difference]: Finished difference Result 999 states and 2438 transitions. [2019-12-27 21:23:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:23:14,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 21:23:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:14,409 INFO L225 Difference]: With dead ends: 999 [2019-12-27 21:23:14,409 INFO L226 Difference]: Without dead ends: 999 [2019-12-27 21:23:14,409 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 21:23:14,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-12-27 21:23:14,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 602. [2019-12-27 21:23:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-12-27 21:23:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1452 transitions. [2019-12-27 21:23:14,426 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1452 transitions. Word has length 59 [2019-12-27 21:23:14,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:14,426 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 1452 transitions. [2019-12-27 21:23:14,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:23:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1452 transitions. [2019-12-27 21:23:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:23:14,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:14,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:14,429 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:14,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:14,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1587836330, now seen corresponding path program 1 times [2019-12-27 21:23:14,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:14,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064527837] [2019-12-27 21:23:14,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:14,598 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 21:23:14,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064527837] [2019-12-27 21:23:14,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:14,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:23:14,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1904347295] [2019-12-27 21:23:14,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:14,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:14,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 213 transitions. [2019-12-27 21:23:14,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:14,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:23:14,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:23:14,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:14,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:23:14,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:23:14,760 INFO L87 Difference]: Start difference. First operand 602 states and 1452 transitions. Second operand 7 states. [2019-12-27 21:23:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:15,019 INFO L93 Difference]: Finished difference Result 1321 states and 3169 transitions. [2019-12-27 21:23:15,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:23:15,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 21:23:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:15,021 INFO L225 Difference]: With dead ends: 1321 [2019-12-27 21:23:15,021 INFO L226 Difference]: Without dead ends: 361 [2019-12-27 21:23:15,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:23:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-12-27 21:23:15,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 234. [2019-12-27 21:23:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-27 21:23:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 413 transitions. [2019-12-27 21:23:15,025 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 413 transitions. Word has length 60 [2019-12-27 21:23:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:15,025 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 413 transitions. [2019-12-27 21:23:15,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:23:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 413 transitions. [2019-12-27 21:23:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:23:15,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:15,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:15,027 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:15,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:15,027 INFO L82 PathProgramCache]: Analyzing trace with hash 91372008, now seen corresponding path program 2 times [2019-12-27 21:23:15,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:15,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379365285] [2019-12-27 21:23:15,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:15,300 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 21:23:15,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379365285] [2019-12-27 21:23:15,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:15,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:23:15,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [19686436] [2019-12-27 21:23:15,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:15,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:15,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 258 transitions. [2019-12-27 21:23:15,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:15,521 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:23:15,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:23:15,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:23:15,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:23:15,523 INFO L87 Difference]: Start difference. First operand 234 states and 413 transitions. Second operand 15 states. [2019-12-27 21:23:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:16,947 INFO L93 Difference]: Finished difference Result 518 states and 889 transitions. [2019-12-27 21:23:16,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 21:23:16,947 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-27 21:23:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:16,948 INFO L225 Difference]: With dead ends: 518 [2019-12-27 21:23:16,948 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 21:23:16,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 21:23:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 21:23:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 330. [2019-12-27 21:23:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 21:23:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 577 transitions. [2019-12-27 21:23:16,954 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 577 transitions. Word has length 60 [2019-12-27 21:23:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:16,955 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 577 transitions. [2019-12-27 21:23:16,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:23:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 577 transitions. [2019-12-27 21:23:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:23:16,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:16,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:16,956 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:16,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2137491580, now seen corresponding path program 3 times [2019-12-27 21:23:16,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:16,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880174774] [2019-12-27 21:23:16,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:23:17,202 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 21:23:17,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880174774] [2019-12-27 21:23:17,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:23:17,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:23:17,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1485130523] [2019-12-27 21:23:17,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:23:17,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:23:17,427 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 321 transitions. [2019-12-27 21:23:17,427 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:23:17,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:23:17,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:23:17,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:23:17,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:23:17,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:23:17,576 INFO L87 Difference]: Start difference. First operand 330 states and 577 transitions. Second operand 15 states. [2019-12-27 21:23:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:23:18,896 INFO L93 Difference]: Finished difference Result 570 states and 957 transitions. [2019-12-27 21:23:18,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:23:18,896 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-27 21:23:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:23:18,897 INFO L225 Difference]: With dead ends: 570 [2019-12-27 21:23:18,897 INFO L226 Difference]: Without dead ends: 540 [2019-12-27 21:23:18,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 21:23:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-12-27 21:23:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 342. [2019-12-27 21:23:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-27 21:23:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 598 transitions. [2019-12-27 21:23:18,903 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 598 transitions. Word has length 60 [2019-12-27 21:23:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:23:18,903 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 598 transitions. [2019-12-27 21:23:18,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:23:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 598 transitions. [2019-12-27 21:23:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:23:18,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:23:18,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:23:18,904 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:23:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:23:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1093452108, now seen corresponding path program 4 times [2019-12-27 21:23:18,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:23:18,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177017119] [2019-12-27 21:23:18,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:23:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:23:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:23:19,035 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:23:19,035 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:23:19,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~z$r_buff0_thd0~0_78 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= v_~z$r_buff1_thd2~0_8 0) (= v_~x~0_14 0) (= 0 v_~a~0_8) (= 0 v_~__unbuffered_p3_EBX~0_11) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$w_buff0_used~0_104 0) (= v_~z$mem_tmp~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (= 0 v_~z$r_buff1_thd4~0_15) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t1253~0.base_21| 1)) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1253~0.base_21| 4)) (= 0 v_~weak$$choice2~0_34) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$r_buff1_thd0~0_51) (= 0 v_~__unbuffered_cnt~0_26) (= 0 v_~z$flush_delayed~0_16) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1253~0.base_21|) (= v_~z$r_buff0_thd4~0_26 0) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 |v_#NULL.base_6|) (= 0 |v_ULTIMATE.start_main_~#t1253~0.offset_17|) (= 0 v_~z$r_buff1_thd3~0_15) (< 0 |v_#StackHeapBarrier_20|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1253~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1253~0.base_21|) |v_ULTIMATE.start_main_~#t1253~0.offset_17| 0)) |v_#memory_int_23|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~z$w_buff0~0_26) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= v_~b~0_12 0) (= 0 v_~z$w_buff1_used~0_66) (= (select .cse0 |v_ULTIMATE.start_main_~#t1253~0.base_21|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ULTIMATE.start_main_~#t1256~0.base=|v_ULTIMATE.start_main_~#t1256~0.base_23|, ULTIMATE.start_main_~#t1256~0.offset=|v_ULTIMATE.start_main_~#t1256~0.offset_18|, ~a~0=v_~a~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_78, ULTIMATE.start_main_~#t1253~0.offset=|v_ULTIMATE.start_main_~#t1253~0.offset_17|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_~#t1255~0.offset=|v_ULTIMATE.start_main_~#t1255~0.offset_18|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_66, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t1254~0.offset=|v_ULTIMATE.start_main_~#t1254~0.offset_18|, ULTIMATE.start_main_~#t1253~0.base=|v_ULTIMATE.start_main_~#t1253~0.base_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_13|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_51, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1254~0.base=|v_ULTIMATE.start_main_~#t1254~0.base_23|, ULTIMATE.start_main_~#t1255~0.base=|v_ULTIMATE.start_main_~#t1255~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1256~0.base, ULTIMATE.start_main_~#t1256~0.offset, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1253~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1255~0.offset, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1254~0.offset, ULTIMATE.start_main_~#t1253~0.base, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1254~0.base, ULTIMATE.start_main_~#t1255~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:23:19,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-1-->L833: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1254~0.base_13| 1)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1254~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1254~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1254~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1254~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1254~0.base_13|) |v_ULTIMATE.start_main_~#t1254~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1254~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1254~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1254~0.offset=|v_ULTIMATE.start_main_~#t1254~0.offset_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1254~0.base=|v_ULTIMATE.start_main_~#t1254~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1254~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1254~0.base] because there is no mapped edge [2019-12-27 21:23:19,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-1-->L835: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1255~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1255~0.offset_10| 0) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1255~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1255~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1255~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1255~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1255~0.base_11|) |v_ULTIMATE.start_main_~#t1255~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1255~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1255~0.base=|v_ULTIMATE.start_main_~#t1255~0.base_11|, ULTIMATE.start_main_~#t1255~0.offset=|v_ULTIMATE.start_main_~#t1255~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1255~0.base, ULTIMATE.start_main_~#t1255~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 21:23:19,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1256~0.base_13| 1) |v_#valid_46|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1256~0.base_13|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1256~0.base_13|) (= |v_ULTIMATE.start_main_~#t1256~0.offset_11| 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1256~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1256~0.base_13|) |v_ULTIMATE.start_main_~#t1256~0.offset_11| 3))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1256~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1256~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1256~0.offset=|v_ULTIMATE.start_main_~#t1256~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1256~0.base=|v_ULTIMATE.start_main_~#t1256~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1256~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1256~0.base] because there is no mapped edge [2019-12-27 21:23:19,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_14 v_~z$r_buff1_thd3~0_10) (= v_~z$r_buff0_thd0~0_61 v_~z$r_buff1_thd0~0_39) (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_3) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_5) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff0_thd4~0_17 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_3) (= v_~z$r_buff0_thd4~0_16 1) (= 1 v_~a~0_3)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:23:19,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x~0_10 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_10, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:23:19,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= 1 v_~y~0_5) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:23:19,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In12699403 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In12699403 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out12699403|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In12699403 |P3Thread1of1ForFork3_#t~ite11_Out12699403|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In12699403, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In12699403} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In12699403, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In12699403, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out12699403|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 21:23:19,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-93614826 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-93614826 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-93614826 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-93614826 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-93614826|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-93614826 |P3Thread1of1ForFork3_#t~ite12_Out-93614826|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-93614826, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-93614826, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-93614826, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-93614826} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-93614826, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-93614826, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-93614826, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-93614826, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-93614826|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 21:23:19,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In969759595 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In969759595 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out969759595| ~z~0_In969759595) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite3_Out969759595| ~z$w_buff1~0_In969759595)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In969759595, ~z$w_buff1_used~0=~z$w_buff1_used~0_In969759595, ~z$w_buff1~0=~z$w_buff1~0_In969759595, ~z~0=~z~0_In969759595} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out969759595|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In969759595, ~z$w_buff1_used~0=~z$w_buff1_used~0_In969759595, ~z$w_buff1~0=~z$w_buff1~0_In969759595, ~z~0=~z~0_In969759595} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:23:19,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 21:23:19,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1663050469 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1663050469 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1663050469 |P2Thread1of1ForFork2_#t~ite5_Out-1663050469|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1663050469|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1663050469, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1663050469} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1663050469|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1663050469, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1663050469} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:23:19,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-508708435 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-508708435 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-508708435 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-508708435 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out-508708435| 0)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-508708435| ~z$w_buff1_used~0_In-508708435) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-508708435, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-508708435, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-508708435, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-508708435} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-508708435|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-508708435, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-508708435, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-508708435, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-508708435} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:23:19,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1268260413 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1268260413 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-1268260413| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out-1268260413| ~z$r_buff0_thd3~0_In-1268260413)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1268260413, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1268260413} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1268260413, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1268260413, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1268260413|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:23:19,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1012799652 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1012799652 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1012799652 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1012799652 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-1012799652 |P2Thread1of1ForFork2_#t~ite8_Out-1012799652|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-1012799652|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1012799652, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1012799652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1012799652, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1012799652} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1012799652, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1012799652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1012799652, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1012799652, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1012799652|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:23:19,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:23:19,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-231847759 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-231847759 256)))) (or (and (= ~z$r_buff0_thd4~0_Out-231847759 ~z$r_buff0_thd4~0_In-231847759) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd4~0_Out-231847759 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-231847759, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-231847759} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-231847759, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-231847759, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-231847759|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 21:23:19,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In-531984518 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-531984518 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-531984518 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-531984518 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out-531984518| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out-531984518| ~z$r_buff1_thd4~0_In-531984518)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-531984518, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-531984518, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-531984518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-531984518} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-531984518, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-531984518, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-531984518|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-531984518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-531984518} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 21:23:19,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L812-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 21:23:19,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 21:23:19,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In594542003 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In594542003 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite20_Out594542003| |ULTIMATE.start_main_#t~ite19_Out594542003|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In594542003 |ULTIMATE.start_main_#t~ite19_Out594542003|)) (and (= ~z$w_buff1~0_In594542003 |ULTIMATE.start_main_#t~ite19_Out594542003|) (not .cse1) (not .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In594542003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594542003, ~z$w_buff1~0=~z$w_buff1~0_In594542003, ~z~0=~z~0_In594542003} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out594542003|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In594542003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594542003, ~z$w_buff1~0=~z$w_buff1~0_In594542003, ~z~0=~z~0_In594542003, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out594542003|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:23:19,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1343060194 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1343060194 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1343060194|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1343060194| ~z$w_buff0_used~0_In-1343060194) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1343060194, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1343060194} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1343060194, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1343060194, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1343060194|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:23:19,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In322219485 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In322219485 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In322219485 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In322219485 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out322219485|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In322219485 |ULTIMATE.start_main_#t~ite22_Out322219485|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In322219485, ~z$w_buff0_used~0=~z$w_buff0_used~0_In322219485, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In322219485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In322219485} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In322219485, ~z$w_buff0_used~0=~z$w_buff0_used~0_In322219485, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In322219485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In322219485, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out322219485|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:23:19,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1597807582 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1597807582 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out1597807582| 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In1597807582 |ULTIMATE.start_main_#t~ite23_Out1597807582|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1597807582, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1597807582} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1597807582, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1597807582, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1597807582|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:23:19,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1683478072 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1683478072 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1683478072 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1683478072 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-1683478072 |ULTIMATE.start_main_#t~ite24_Out-1683478072|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-1683478072|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1683478072, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683478072, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1683478072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1683478072} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1683478072, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683478072, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1683478072, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1683478072|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1683478072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:23:19,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L855-->L855-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1678797828 256)))) (or (and (= |ULTIMATE.start_main_#t~ite30_In-1678797828| |ULTIMATE.start_main_#t~ite30_Out-1678797828|) (= ~z$w_buff0~0_In-1678797828 |ULTIMATE.start_main_#t~ite31_Out-1678797828|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite30_Out-1678797828| ~z$w_buff0~0_In-1678797828) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1678797828 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1678797828 256)) (and (= (mod ~z$w_buff1_used~0_In-1678797828 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1678797828 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite30_Out-1678797828| |ULTIMATE.start_main_#t~ite31_Out-1678797828|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1678797828, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In-1678797828|, ~z$w_buff0~0=~z$w_buff0~0_In-1678797828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1678797828, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1678797828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1678797828, ~weak$$choice2~0=~weak$$choice2~0_In-1678797828} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1678797828, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1678797828|, ~z$w_buff0~0=~z$w_buff0~0_In-1678797828, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1678797828, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1678797828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1678797828, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1678797828|, ~weak$$choice2~0=~weak$$choice2~0_In-1678797828} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-27 21:23:19,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L856-->L856-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-28482287 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out-28482287| |ULTIMATE.start_main_#t~ite33_Out-28482287|) .cse0 (= |ULTIMATE.start_main_#t~ite33_Out-28482287| ~z$w_buff1~0_In-28482287) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-28482287 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-28482287 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd0~0_In-28482287 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-28482287 256))))) (and (= |ULTIMATE.start_main_#t~ite33_In-28482287| |ULTIMATE.start_main_#t~ite33_Out-28482287|) (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out-28482287| ~z$w_buff1~0_In-28482287)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-28482287, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-28482287, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-28482287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-28482287, ~z$w_buff1~0=~z$w_buff1~0_In-28482287, ~weak$$choice2~0=~weak$$choice2~0_In-28482287, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In-28482287|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-28482287, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-28482287, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-28482287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-28482287, ~z$w_buff1~0=~z$w_buff1~0_In-28482287, ~weak$$choice2~0=~weak$$choice2~0_In-28482287, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-28482287|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-28482287|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 21:23:19,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_58)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:23:19,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In598407967 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In598407967| |ULTIMATE.start_main_#t~ite45_Out598407967|) (= |ULTIMATE.start_main_#t~ite46_Out598407967| ~z$r_buff1_thd0~0_In598407967)) (and (= |ULTIMATE.start_main_#t~ite45_Out598407967| ~z$r_buff1_thd0~0_In598407967) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In598407967 256) 0))) (or (= (mod ~z$w_buff0_used~0_In598407967 256) 0) (and (= 0 (mod ~z$r_buff1_thd0~0_In598407967 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In598407967 256)) .cse1))) .cse0 (= |ULTIMATE.start_main_#t~ite46_Out598407967| |ULTIMATE.start_main_#t~ite45_Out598407967|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In598407967, ~z$w_buff0_used~0=~z$w_buff0_used~0_In598407967, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In598407967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In598407967, ~weak$$choice2~0=~weak$$choice2~0_In598407967, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In598407967|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In598407967, ~z$w_buff0_used~0=~z$w_buff0_used~0_In598407967, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In598407967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In598407967, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out598407967|, ~weak$$choice2~0=~weak$$choice2~0_In598407967, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out598407967|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:23:19,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= v_~z~0_20 v_~z$mem_tmp~0_6) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:23:19,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:23:19,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:23:19 BasicIcfg [2019-12-27 21:23:19,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:23:19,190 INFO L168 Benchmark]: Toolchain (without parser) took 32903.02 ms. Allocated memory was 138.4 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 100.3 MB in the beginning and 443.7 MB in the end (delta: -343.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:23:19,190 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:23:19,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.59 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 99.9 MB in the beginning and 155.7 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:23:19,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.99 ms. Allocated memory is still 203.4 MB. Free memory was 155.7 MB in the beginning and 152.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:23:19,196 INFO L168 Benchmark]: Boogie Preprocessor took 39.05 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:23:19,198 INFO L168 Benchmark]: RCFGBuilder took 847.53 ms. Allocated memory is still 203.4 MB. Free memory was 150.5 MB in the beginning and 100.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:23:19,199 INFO L168 Benchmark]: TraceAbstraction took 31153.39 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.9 MB in the beginning and 443.7 MB in the end (delta: -342.7 MB). Peak memory consumption was 958.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:23:19,207 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.16 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.59 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 99.9 MB in the beginning and 155.7 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.99 ms. Allocated memory is still 203.4 MB. Free memory was 155.7 MB in the beginning and 152.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.05 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.53 ms. Allocated memory is still 203.4 MB. Free memory was 150.5 MB in the beginning and 100.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31153.39 ms. Allocated memory was 203.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.9 MB in the beginning and 443.7 MB in the end (delta: -342.7 MB). Peak memory consumption was 958.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 4932 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 52826 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1863 SDtfs, 2558 SDslu, 5195 SDs, 0 SdLazy, 3182 SolverSat, 258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 71 SyntacticMatches, 22 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50002occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 9639 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 159015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...