/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:09:31,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:09:31,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:09:31,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:09:31,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:09:31,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:09:31,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:09:31,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:09:31,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:09:31,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:09:31,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:09:31,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:09:31,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:09:31,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:09:31,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:09:31,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:09:31,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:09:31,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:09:31,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:09:31,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:09:31,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:09:31,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:09:31,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:09:31,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:09:31,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:09:31,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:09:31,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:09:31,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:09:31,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:09:31,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:09:31,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:09:31,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:09:31,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:09:31,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:09:31,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:09:31,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:09:31,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:09:31,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:09:31,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:09:31,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:09:31,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:09:31,183 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:09:31,211 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:09:31,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:09:31,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:09:31,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:09:31,215 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:09:31,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:09:31,216 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:09:31,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:09:31,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:09:31,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:09:31,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:09:31,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:09:31,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:09:31,218 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:09:31,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:09:31,218 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:09:31,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:09:31,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:09:31,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:09:31,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:09:31,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:09:31,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:09:31,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:09:31,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:09:31,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:09:31,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:09:31,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:09:31,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:09:31,222 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:09:31,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:09:31,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:09:31,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:09:31,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:09:31,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:09:31,510 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:09:31,511 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2019-12-18 15:09:31,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a998b80/e22f5d496ee2483ebfd9eecaf4794373/FLAG57c6b49d5 [2019-12-18 15:09:32,091 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:09:32,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2019-12-18 15:09:32,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a998b80/e22f5d496ee2483ebfd9eecaf4794373/FLAG57c6b49d5 [2019-12-18 15:09:32,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34a998b80/e22f5d496ee2483ebfd9eecaf4794373 [2019-12-18 15:09:32,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:09:32,428 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:09:32,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:32,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:09:32,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:09:32,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:32" (1/1) ... [2019-12-18 15:09:32,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:32, skipping insertion in model container [2019-12-18 15:09:32,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:32" (1/1) ... [2019-12-18 15:09:32,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:09:32,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:09:33,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:33,033 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:09:33,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:33,189 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:09:33,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33 WrapperNode [2019-12-18 15:09:33,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:33,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:33,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:09:33,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:09:33,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33" (1/1) ... [2019-12-18 15:09:33,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33" (1/1) ... [2019-12-18 15:09:33,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:33,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:09:33,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:09:33,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:09:33,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33" (1/1) ... [2019-12-18 15:09:33,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33" (1/1) ... [2019-12-18 15:09:33,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33" (1/1) ... [2019-12-18 15:09:33,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33" (1/1) ... [2019-12-18 15:09:33,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33" (1/1) ... [2019-12-18 15:09:33,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33" (1/1) ... [2019-12-18 15:09:33,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33" (1/1) ... [2019-12-18 15:09:33,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:09:33,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:09:33,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:09:33,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:09:33,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:09:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:09:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:09:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:09:33,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:09:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:09:33,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:09:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:09:33,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:09:33,379 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:09:33,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:09:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:09:33,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:09:33,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:09:33,382 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:09:34,100 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:09:34,101 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:09:34,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:34 BoogieIcfgContainer [2019-12-18 15:09:34,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:09:34,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:09:34,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:09:34,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:09:34,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:09:32" (1/3) ... [2019-12-18 15:09:34,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5f01d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:34, skipping insertion in model container [2019-12-18 15:09:34,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:33" (2/3) ... [2019-12-18 15:09:34,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5f01d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:34, skipping insertion in model container [2019-12-18 15:09:34,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:34" (3/3) ... [2019-12-18 15:09:34,111 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt.i [2019-12-18 15:09:34,122 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:09:34,123 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:09:34,131 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:09:34,132 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:09:34,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,172 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,172 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,184 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,184 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,184 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,185 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,185 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,196 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,197 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,198 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,204 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,204 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:34,221 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:09:34,241 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:09:34,241 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:09:34,241 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:09:34,241 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:09:34,242 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:09:34,242 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:09:34,242 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:09:34,242 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:09:34,259 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 15:09:34,261 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 15:09:34,361 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 15:09:34,361 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:34,380 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:34,399 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 15:09:34,477 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 15:09:34,477 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:34,485 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:34,501 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 15:09:34,502 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:09:39,312 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 15:09:39,434 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 15:09:39,464 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48124 [2019-12-18 15:09:39,464 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 15:09:39,468 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 94 transitions [2019-12-18 15:09:40,547 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15710 states. [2019-12-18 15:09:40,549 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states. [2019-12-18 15:09:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:09:40,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:40,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:40,556 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:40,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:40,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2126234855, now seen corresponding path program 1 times [2019-12-18 15:09:40,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:40,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129481230] [2019-12-18 15:09:40,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:40,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129481230] [2019-12-18 15:09:40,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:40,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:09:40,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858475658] [2019-12-18 15:09:40,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:40,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:40,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:40,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:40,877 INFO L87 Difference]: Start difference. First operand 15710 states. Second operand 3 states. [2019-12-18 15:09:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:41,383 INFO L93 Difference]: Finished difference Result 15638 states and 59348 transitions. [2019-12-18 15:09:41,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:41,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 15:09:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:41,590 INFO L225 Difference]: With dead ends: 15638 [2019-12-18 15:09:41,591 INFO L226 Difference]: Without dead ends: 15326 [2019-12-18 15:09:41,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:41,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15326 states. [2019-12-18 15:09:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15326 to 15326. [2019-12-18 15:09:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15326 states. [2019-12-18 15:09:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15326 states to 15326 states and 58230 transitions. [2019-12-18 15:09:42,949 INFO L78 Accepts]: Start accepts. Automaton has 15326 states and 58230 transitions. Word has length 7 [2019-12-18 15:09:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:42,950 INFO L462 AbstractCegarLoop]: Abstraction has 15326 states and 58230 transitions. [2019-12-18 15:09:42,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:42,950 INFO L276 IsEmpty]: Start isEmpty. Operand 15326 states and 58230 transitions. [2019-12-18 15:09:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:09:42,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:42,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:42,955 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:42,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:42,955 INFO L82 PathProgramCache]: Analyzing trace with hash -380072381, now seen corresponding path program 1 times [2019-12-18 15:09:42,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:42,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168103288] [2019-12-18 15:09:42,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:43,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168103288] [2019-12-18 15:09:43,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:43,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:43,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796473649] [2019-12-18 15:09:43,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:43,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:43,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:43,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:43,079 INFO L87 Difference]: Start difference. First operand 15326 states and 58230 transitions. Second operand 4 states. [2019-12-18 15:09:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:43,786 INFO L93 Difference]: Finished difference Result 24490 states and 89350 transitions. [2019-12-18 15:09:43,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:43,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:09:43,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:43,891 INFO L225 Difference]: With dead ends: 24490 [2019-12-18 15:09:43,891 INFO L226 Difference]: Without dead ends: 24476 [2019-12-18 15:09:43,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24476 states. [2019-12-18 15:09:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24476 to 22206. [2019-12-18 15:09:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22206 states. [2019-12-18 15:09:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22206 states to 22206 states and 82052 transitions. [2019-12-18 15:09:46,137 INFO L78 Accepts]: Start accepts. Automaton has 22206 states and 82052 transitions. Word has length 13 [2019-12-18 15:09:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:46,137 INFO L462 AbstractCegarLoop]: Abstraction has 22206 states and 82052 transitions. [2019-12-18 15:09:46,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 22206 states and 82052 transitions. [2019-12-18 15:09:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:09:46,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:46,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:46,141 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:46,141 INFO L82 PathProgramCache]: Analyzing trace with hash 691839138, now seen corresponding path program 1 times [2019-12-18 15:09:46,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:46,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205775894] [2019-12-18 15:09:46,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:46,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205775894] [2019-12-18 15:09:46,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:46,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:46,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549614681] [2019-12-18 15:09:46,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:46,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:46,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:46,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:46,221 INFO L87 Difference]: Start difference. First operand 22206 states and 82052 transitions. Second operand 3 states. [2019-12-18 15:09:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:46,285 INFO L93 Difference]: Finished difference Result 12702 states and 40687 transitions. [2019-12-18 15:09:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:46,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 15:09:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:46,334 INFO L225 Difference]: With dead ends: 12702 [2019-12-18 15:09:46,334 INFO L226 Difference]: Without dead ends: 12702 [2019-12-18 15:09:46,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-18 15:09:46,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12702. [2019-12-18 15:09:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12702 states. [2019-12-18 15:09:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 40687 transitions. [2019-12-18 15:09:46,677 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 40687 transitions. Word has length 13 [2019-12-18 15:09:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:46,679 INFO L462 AbstractCegarLoop]: Abstraction has 12702 states and 40687 transitions. [2019-12-18 15:09:46,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 40687 transitions. [2019-12-18 15:09:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:09:46,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:46,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:46,689 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:46,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1718037058, now seen corresponding path program 1 times [2019-12-18 15:09:46,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:46,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389235536] [2019-12-18 15:09:46,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:46,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389235536] [2019-12-18 15:09:46,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:46,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:46,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039649491] [2019-12-18 15:09:46,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:46,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:46,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:46,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:46,783 INFO L87 Difference]: Start difference. First operand 12702 states and 40687 transitions. Second operand 4 states. [2019-12-18 15:09:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:46,813 INFO L93 Difference]: Finished difference Result 1935 states and 4569 transitions. [2019-12-18 15:09:46,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:09:46,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 15:09:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:46,819 INFO L225 Difference]: With dead ends: 1935 [2019-12-18 15:09:46,819 INFO L226 Difference]: Without dead ends: 1935 [2019-12-18 15:09:46,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-18 15:09:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-18 15:09:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-18 15:09:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4569 transitions. [2019-12-18 15:09:46,853 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4569 transitions. Word has length 14 [2019-12-18 15:09:46,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:46,853 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4569 transitions. [2019-12-18 15:09:46,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:09:46,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4569 transitions. [2019-12-18 15:09:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:09:46,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:46,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:46,856 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:46,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:46,857 INFO L82 PathProgramCache]: Analyzing trace with hash 968226525, now seen corresponding path program 1 times [2019-12-18 15:09:46,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:46,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719702663] [2019-12-18 15:09:46,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:46,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719702663] [2019-12-18 15:09:46,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:46,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:09:46,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387240713] [2019-12-18 15:09:46,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:09:46,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:46,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:09:46,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:46,995 INFO L87 Difference]: Start difference. First operand 1935 states and 4569 transitions. Second operand 5 states. [2019-12-18 15:09:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:47,020 INFO L93 Difference]: Finished difference Result 630 states and 1476 transitions. [2019-12-18 15:09:47,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:47,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 15:09:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:47,023 INFO L225 Difference]: With dead ends: 630 [2019-12-18 15:09:47,023 INFO L226 Difference]: Without dead ends: 630 [2019-12-18 15:09:47,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:47,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-12-18 15:09:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 574. [2019-12-18 15:09:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-18 15:09:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1344 transitions. [2019-12-18 15:09:47,033 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1344 transitions. Word has length 26 [2019-12-18 15:09:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:47,034 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1344 transitions. [2019-12-18 15:09:47,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:09:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1344 transitions. [2019-12-18 15:09:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:47,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:47,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:47,039 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:47,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash 196092715, now seen corresponding path program 1 times [2019-12-18 15:09:47,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:47,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527494844] [2019-12-18 15:09:47,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:47,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527494844] [2019-12-18 15:09:47,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:47,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:09:47,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467093268] [2019-12-18 15:09:47,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:47,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:47,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:47,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:47,147 INFO L87 Difference]: Start difference. First operand 574 states and 1344 transitions. Second operand 3 states. [2019-12-18 15:09:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:47,205 INFO L93 Difference]: Finished difference Result 584 states and 1354 transitions. [2019-12-18 15:09:47,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:47,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 15:09:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:47,207 INFO L225 Difference]: With dead ends: 584 [2019-12-18 15:09:47,207 INFO L226 Difference]: Without dead ends: 584 [2019-12-18 15:09:47,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-18 15:09:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-12-18 15:09:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-18 15:09:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1350 transitions. [2019-12-18 15:09:47,218 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1350 transitions. Word has length 55 [2019-12-18 15:09:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:47,219 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1350 transitions. [2019-12-18 15:09:47,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1350 transitions. [2019-12-18 15:09:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:47,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:47,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:47,221 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash -922835002, now seen corresponding path program 1 times [2019-12-18 15:09:47,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:47,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574594828] [2019-12-18 15:09:47,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:47,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574594828] [2019-12-18 15:09:47,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:47,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:09:47,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967605805] [2019-12-18 15:09:47,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:47,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:47,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:47,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:47,401 INFO L87 Difference]: Start difference. First operand 580 states and 1350 transitions. Second operand 6 states. [2019-12-18 15:09:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:47,863 INFO L93 Difference]: Finished difference Result 933 states and 2172 transitions. [2019-12-18 15:09:47,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:09:47,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 15:09:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:47,867 INFO L225 Difference]: With dead ends: 933 [2019-12-18 15:09:47,867 INFO L226 Difference]: Without dead ends: 933 [2019-12-18 15:09:47,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 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-18 15:09:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-12-18 15:09:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 738. [2019-12-18 15:09:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-18 15:09:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1733 transitions. [2019-12-18 15:09:47,883 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1733 transitions. Word has length 55 [2019-12-18 15:09:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:47,883 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1733 transitions. [2019-12-18 15:09:47,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1733 transitions. [2019-12-18 15:09:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:47,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:47,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:47,887 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:47,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:47,887 INFO L82 PathProgramCache]: Analyzing trace with hash -256459022, now seen corresponding path program 2 times [2019-12-18 15:09:47,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:47,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956728509] [2019-12-18 15:09:47,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:47,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956728509] [2019-12-18 15:09:47,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:47,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:09:47,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553466218] [2019-12-18 15:09:47,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:09:47,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:47,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:09:47,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:09:47,999 INFO L87 Difference]: Start difference. First operand 738 states and 1733 transitions. Second operand 6 states. [2019-12-18 15:09:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:48,352 INFO L93 Difference]: Finished difference Result 1275 states and 2967 transitions. [2019-12-18 15:09:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:09:48,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 15:09:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:48,355 INFO L225 Difference]: With dead ends: 1275 [2019-12-18 15:09:48,355 INFO L226 Difference]: Without dead ends: 1275 [2019-12-18 15:09:48,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:09:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-12-18 15:09:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 816. [2019-12-18 15:09:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-12-18 15:09:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1930 transitions. [2019-12-18 15:09:48,371 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1930 transitions. Word has length 55 [2019-12-18 15:09:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:48,371 INFO L462 AbstractCegarLoop]: Abstraction has 816 states and 1930 transitions. [2019-12-18 15:09:48,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:09:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1930 transitions. [2019-12-18 15:09:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:09:48,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:48,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:48,374 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:48,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:48,374 INFO L82 PathProgramCache]: Analyzing trace with hash -198491454, now seen corresponding path program 3 times [2019-12-18 15:09:48,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:48,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257294647] [2019-12-18 15:09:48,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:48,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257294647] [2019-12-18 15:09:48,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:48,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:48,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574382239] [2019-12-18 15:09:48,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:48,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:48,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:48,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:48,470 INFO L87 Difference]: Start difference. First operand 816 states and 1930 transitions. Second operand 3 states. [2019-12-18 15:09:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:48,484 INFO L93 Difference]: Finished difference Result 738 states and 1703 transitions. [2019-12-18 15:09:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:48,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 15:09:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:48,486 INFO L225 Difference]: With dead ends: 738 [2019-12-18 15:09:48,486 INFO L226 Difference]: Without dead ends: 738 [2019-12-18 15:09:48,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-18 15:09:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-12-18 15:09:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-18 15:09:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1703 transitions. [2019-12-18 15:09:48,497 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1703 transitions. Word has length 55 [2019-12-18 15:09:48,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:48,497 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1703 transitions. [2019-12-18 15:09:48,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1703 transitions. [2019-12-18 15:09:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:48,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:48,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:48,500 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:48,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:48,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1314270907, now seen corresponding path program 1 times [2019-12-18 15:09:48,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:48,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908909743] [2019-12-18 15:09:48,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:48,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908909743] [2019-12-18 15:09:48,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:48,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:09:48,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874399143] [2019-12-18 15:09:48,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:09:48,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:48,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:09:48,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:09:48,661 INFO L87 Difference]: Start difference. First operand 738 states and 1703 transitions. Second operand 8 states. [2019-12-18 15:09:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:49,121 INFO L93 Difference]: Finished difference Result 1118 states and 2536 transitions. [2019-12-18 15:09:49,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:09:49,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-18 15:09:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:49,124 INFO L225 Difference]: With dead ends: 1118 [2019-12-18 15:09:49,124 INFO L226 Difference]: Without dead ends: 1118 [2019-12-18 15:09:49,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:09:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-12-18 15:09:49,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 670. [2019-12-18 15:09:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-18 15:09:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1537 transitions. [2019-12-18 15:09:49,137 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1537 transitions. Word has length 56 [2019-12-18 15:09:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:49,137 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1537 transitions. [2019-12-18 15:09:49,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:09:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1537 transitions. [2019-12-18 15:09:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:49,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:49,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:49,140 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:49,140 INFO L82 PathProgramCache]: Analyzing trace with hash 69556479, now seen corresponding path program 2 times [2019-12-18 15:09:49,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:49,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294735256] [2019-12-18 15:09:49,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:49,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294735256] [2019-12-18 15:09:49,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:49,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:09:49,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855383623] [2019-12-18 15:09:49,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:09:49,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:49,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:09:49,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:09:49,248 INFO L87 Difference]: Start difference. First operand 670 states and 1537 transitions. Second operand 5 states. [2019-12-18 15:09:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:49,304 INFO L93 Difference]: Finished difference Result 958 states and 2050 transitions. [2019-12-18 15:09:49,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:49,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 15:09:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:49,306 INFO L225 Difference]: With dead ends: 958 [2019-12-18 15:09:49,306 INFO L226 Difference]: Without dead ends: 601 [2019-12-18 15:09:49,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:09:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-12-18 15:09:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-12-18 15:09:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-12-18 15:09:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1338 transitions. [2019-12-18 15:09:49,315 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1338 transitions. Word has length 56 [2019-12-18 15:09:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:49,316 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 1338 transitions. [2019-12-18 15:09:49,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:09:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1338 transitions. [2019-12-18 15:09:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:49,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:49,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:49,318 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:49,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1040007325, now seen corresponding path program 3 times [2019-12-18 15:09:49,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:49,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960371502] [2019-12-18 15:09:49,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:49,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960371502] [2019-12-18 15:09:49,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:49,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:09:49,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117544852] [2019-12-18 15:09:49,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:09:49,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:09:49,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:09:49,601 INFO L87 Difference]: Start difference. First operand 601 states and 1338 transitions. Second operand 10 states. [2019-12-18 15:09:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:50,061 INFO L93 Difference]: Finished difference Result 1175 states and 2620 transitions. [2019-12-18 15:09:50,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:09:50,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 15:09:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:50,063 INFO L225 Difference]: With dead ends: 1175 [2019-12-18 15:09:50,063 INFO L226 Difference]: Without dead ends: 275 [2019-12-18 15:09:50,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-12-18 15:09:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-12-18 15:09:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 251. [2019-12-18 15:09:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-18 15:09:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 429 transitions. [2019-12-18 15:09:50,067 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 429 transitions. Word has length 56 [2019-12-18 15:09:50,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:50,068 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 429 transitions. [2019-12-18 15:09:50,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:09:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 429 transitions. [2019-12-18 15:09:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:09:50,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:50,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:50,069 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash 791586909, now seen corresponding path program 4 times [2019-12-18 15:09:50,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:50,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000876694] [2019-12-18 15:09:50,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:50,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000876694] [2019-12-18 15:09:50,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:50,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:50,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341133968] [2019-12-18 15:09:50,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:50,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:50,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:50,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:50,129 INFO L87 Difference]: Start difference. First operand 251 states and 429 transitions. Second operand 3 states. [2019-12-18 15:09:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:50,169 INFO L93 Difference]: Finished difference Result 251 states and 428 transitions. [2019-12-18 15:09:50,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:50,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 15:09:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:50,170 INFO L225 Difference]: With dead ends: 251 [2019-12-18 15:09:50,170 INFO L226 Difference]: Without dead ends: 251 [2019-12-18 15:09:50,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-18 15:09:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 202. [2019-12-18 15:09:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-18 15:09:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 344 transitions. [2019-12-18 15:09:50,174 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 344 transitions. Word has length 56 [2019-12-18 15:09:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:50,175 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 344 transitions. [2019-12-18 15:09:50,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 344 transitions. [2019-12-18 15:09:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:09:50,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:50,176 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] [2019-12-18 15:09:50,176 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:50,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:50,177 INFO L82 PathProgramCache]: Analyzing trace with hash -431408076, now seen corresponding path program 1 times [2019-12-18 15:09:50,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:50,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980083304] [2019-12-18 15:09:50,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:50,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980083304] [2019-12-18 15:09:50,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:50,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:09:50,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313211020] [2019-12-18 15:09:50,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:09:50,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:50,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:09:50,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:09:50,496 INFO L87 Difference]: Start difference. First operand 202 states and 344 transitions. Second operand 13 states. [2019-12-18 15:09:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:51,099 INFO L93 Difference]: Finished difference Result 371 states and 622 transitions. [2019-12-18 15:09:51,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:09:51,100 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 15:09:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:51,101 INFO L225 Difference]: With dead ends: 371 [2019-12-18 15:09:51,101 INFO L226 Difference]: Without dead ends: 336 [2019-12-18 15:09:51,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:09:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-18 15:09:51,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 302. [2019-12-18 15:09:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-12-18 15:09:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 515 transitions. [2019-12-18 15:09:51,108 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 515 transitions. Word has length 57 [2019-12-18 15:09:51,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:51,108 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 515 transitions. [2019-12-18 15:09:51,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:09:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 515 transitions. [2019-12-18 15:09:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:09:51,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:51,109 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] [2019-12-18 15:09:51,110 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:51,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:51,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613688, now seen corresponding path program 2 times [2019-12-18 15:09:51,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:51,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145396460] [2019-12-18 15:09:51,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:51,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145396460] [2019-12-18 15:09:51,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:51,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 15:09:51,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655147932] [2019-12-18 15:09:51,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:09:51,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:51,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:09:51,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:09:51,717 INFO L87 Difference]: Start difference. First operand 302 states and 515 transitions. Second operand 19 states. [2019-12-18 15:09:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:53,013 INFO L93 Difference]: Finished difference Result 569 states and 950 transitions. [2019-12-18 15:09:53,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 15:09:53,014 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-18 15:09:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:53,015 INFO L225 Difference]: With dead ends: 569 [2019-12-18 15:09:53,015 INFO L226 Difference]: Without dead ends: 536 [2019-12-18 15:09:53,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 15:09:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-12-18 15:09:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 314. [2019-12-18 15:09:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-18 15:09:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 537 transitions. [2019-12-18 15:09:53,022 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 537 transitions. Word has length 57 [2019-12-18 15:09:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:53,022 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 537 transitions. [2019-12-18 15:09:53,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:09:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 537 transitions. [2019-12-18 15:09:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:09:53,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:53,023 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] [2019-12-18 15:09:53,023 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:53,024 INFO L82 PathProgramCache]: Analyzing trace with hash -959480564, now seen corresponding path program 3 times [2019-12-18 15:09:53,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:53,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292836135] [2019-12-18 15:09:53,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:09:53,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292836135] [2019-12-18 15:09:53,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:53,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:09:53,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954382729] [2019-12-18 15:09:53,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:09:53,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:53,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:09:53,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:09:53,246 INFO L87 Difference]: Start difference. First operand 314 states and 537 transitions. Second operand 13 states. [2019-12-18 15:09:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:53,790 INFO L93 Difference]: Finished difference Result 419 states and 695 transitions. [2019-12-18 15:09:53,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:09:53,791 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 15:09:53,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:53,792 INFO L225 Difference]: With dead ends: 419 [2019-12-18 15:09:53,792 INFO L226 Difference]: Without dead ends: 384 [2019-12-18 15:09:53,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:09:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-12-18 15:09:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 310. [2019-12-18 15:09:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-12-18 15:09:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 529 transitions. [2019-12-18 15:09:53,798 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 529 transitions. Word has length 57 [2019-12-18 15:09:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:53,799 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 529 transitions. [2019-12-18 15:09:53,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:09:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 529 transitions. [2019-12-18 15:09:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 15:09:53,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:53,800 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] [2019-12-18 15:09:53,800 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:53,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:53,801 INFO L82 PathProgramCache]: Analyzing trace with hash -97225810, now seen corresponding path program 4 times [2019-12-18 15:09:53,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:53,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753145561] [2019-12-18 15:09:53,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:09:53,900 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:09:53,901 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:09:53,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~y$w_buff1~0_198 0) (= v_~x~0_55 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~weak$$choice2~0_120 0) (= v_~main$tmp_guard1~0_31 0) (= v_~y$r_buff1_thd0~0_279 0) (= 0 v_~y$r_buff1_thd2~0_191) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$w_buff0~0_215) (= 0 |v_ULTIMATE.start_main_~#t2522~0.offset_17|) (= 0 v_~y$r_buff0_thd3~0_201) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd0~0_331 0) (= v_~y$r_buff0_thd1~0_37 0) (= v_~y$w_buff0_used~0_623 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2522~0.base_22| 1)) (= 0 |v_#NULL.base_4|) (= v_~y~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_42) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_20 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~y$flush_delayed~0_42) (= 0 v_~y$r_buff0_thd2~0_116) (= v_~y$w_buff1_used~0_397 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_26 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2522~0.base_22| 4) |v_#length_21|) (= 0 v_~y$r_buff1_thd3~0_162) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2522~0.base_22|)) (= v_~z~0_148 0) (= 0 v_~__unbuffered_cnt~0_97) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2522~0.base_22|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2522~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2522~0.base_22|) |v_ULTIMATE.start_main_~#t2522~0.offset_17| 0)) |v_#memory_int_19|) (= v_~y$r_buff1_thd1~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_40|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_23|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_23|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_46|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_162, ULTIMATE.start_main_~#t2522~0.base=|v_ULTIMATE.start_main_~#t2522~0.base_22|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ULTIMATE.start_main_~#t2522~0.offset=|v_ULTIMATE.start_main_~#t2522~0.offset_17|, #length=|v_#length_21|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_27|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_35|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_60|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_65|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_198, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_116, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t2524~0.offset=|v_ULTIMATE.start_main_~#t2524~0.offset_15|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_279, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_623, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_44|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_31|, ULTIMATE.start_main_~#t2523~0.offset=|v_ULTIMATE.start_main_~#t2523~0.offset_15|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_129|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_28|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_37|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_116, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_25|, ~y$w_buff0~0=v_~y$w_buff0~0_215, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_201, ULTIMATE.start_main_~#t2524~0.base=|v_ULTIMATE.start_main_~#t2524~0.base_18|, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t2523~0.base=|v_ULTIMATE.start_main_~#t2523~0.base_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_31|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_64|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_24|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_191, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_331, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t2522~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2522~0.offset, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2524~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_~#t2523~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2524~0.base, ~y~0, ULTIMATE.start_main_~#t2523~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:09:53,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2523~0.base_11|) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2523~0.base_11| 1) |v_#valid_33|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2523~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2523~0.base_11|) |v_ULTIMATE.start_main_~#t2523~0.offset_10| 1)) |v_#memory_int_15|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2523~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t2523~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2523~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2523~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2523~0.base=|v_ULTIMATE.start_main_~#t2523~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2523~0.offset=|v_ULTIMATE.start_main_~#t2523~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2523~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2523~0.offset] because there is no mapped edge [2019-12-18 15:09:53,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L804-1-->L806: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2524~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2524~0.base_10| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2524~0.base_10| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2524~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2524~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t2524~0.base_10| 0)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2524~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2524~0.base_10|) |v_ULTIMATE.start_main_~#t2524~0.offset_10| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2524~0.base=|v_ULTIMATE.start_main_~#t2524~0.base_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2524~0.offset=|v_ULTIMATE.start_main_~#t2524~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2524~0.base, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2524~0.offset] because there is no mapped edge [2019-12-18 15:09:53,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [616] [616] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_24) (= 2 v_~y$w_buff0~0_28) (= |v_P2Thread1of1ForFork0_#in~arg.base_11| v_P2Thread1of1ForFork0_~arg.base_11) (= v_~y$w_buff0_used~0_103 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_11| v_P2Thread1of1ForFork0_~arg.offset_11) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff1_used~0_54 v_~y$w_buff0_used~0_104) (= 0 (mod v_~y$w_buff1_used~0_54 256))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_29, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_11, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_28, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_11, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:09:53,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_15| 0) (= 0 |v_P0Thread1of1ForFork1_#res.offset_15|) (= v_~x~0_47 v_~__unbuffered_p0_EAX~0_32) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~z~0_109 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_15|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, ~z~0=v_~z~0_109, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 15:09:53,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-798235608 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-798235608 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-798235608 |P2Thread1of1ForFork0_#t~ite11_Out-798235608|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_Out-798235608| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-798235608, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-798235608} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-798235608, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-798235608|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-798235608} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 15:09:53,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1759521446 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1759521446 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite4_Out-1759521446| |P1Thread1of1ForFork2_#t~ite3_Out-1759521446|))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-1759521446| ~y$w_buff1~0_In-1759521446) .cse2) (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite3_Out-1759521446| ~y~0_In-1759521446)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1759521446, ~y$w_buff1~0=~y$w_buff1~0_In-1759521446, ~y~0=~y~0_In-1759521446, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1759521446} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1759521446, ~y$w_buff1~0=~y$w_buff1~0_In-1759521446, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-1759521446|, ~y~0=~y~0_In-1759521446, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1759521446|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1759521446} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 15:09:53,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2134521839 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2134521839 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-2134521839|)) (and (= ~y$w_buff0_used~0_In-2134521839 |P1Thread1of1ForFork2_#t~ite5_Out-2134521839|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2134521839, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2134521839} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2134521839, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2134521839, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-2134521839|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 15:09:53,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-743639206 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-743639206 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-743639206 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-743639206 256)))) (or (and (= ~y$w_buff1_used~0_In-743639206 |P2Thread1of1ForFork0_#t~ite12_Out-743639206|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-743639206|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-743639206, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-743639206, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-743639206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-743639206} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-743639206, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-743639206, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-743639206|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-743639206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-743639206} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 15:09:53,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In1148049817 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1148049817 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1148049817 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1148049817 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out1148049817|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1148049817 |P1Thread1of1ForFork2_#t~ite6_Out1148049817|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1148049817, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1148049817, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1148049817, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1148049817} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1148049817, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1148049817, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1148049817, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1148049817|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1148049817} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 15:09:53,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In190733689 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In190733689 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out190733689| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite7_Out190733689| ~y$r_buff0_thd2~0_In190733689) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In190733689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In190733689} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In190733689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In190733689, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out190733689|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 15:09:53,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-60555463 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-60555463 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-60555463 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-60555463 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-60555463|)) (and (= ~y$r_buff1_thd2~0_In-60555463 |P1Thread1of1ForFork2_#t~ite8_Out-60555463|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-60555463, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-60555463, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-60555463, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-60555463} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-60555463, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-60555463, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-60555463|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-60555463, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-60555463} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 15:09:53,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork2_#t~ite8_26| v_~y$r_buff1_thd2~0_103) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_103, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 15:09:53,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1114620541 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1114620541 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out1114620541 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out1114620541 ~y$r_buff0_thd3~0_In1114620541)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1114620541, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1114620541} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1114620541, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1114620541, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out1114620541|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 15:09:53,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1402730083 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1402730083 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1402730083 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1402730083 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out1402730083| ~y$r_buff1_thd3~0_In1402730083)) (and (= |P2Thread1of1ForFork0_#t~ite14_Out1402730083| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1402730083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1402730083, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1402730083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1402730083} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1402730083|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1402730083, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1402730083, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1402730083, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1402730083} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 15:09:53,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L783-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_26| v_~y$r_buff1_thd3~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_25|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_99, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 15:09:53,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [614] [614] L806-1-->L812: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 15:09:53,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In425540149 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out425540149| |ULTIMATE.start_main_#t~ite18_Out425540149|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In425540149 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out425540149| ~y~0_In425540149) .cse2) (and (not .cse0) (= ~y$w_buff1~0_In425540149 |ULTIMATE.start_main_#t~ite18_Out425540149|) .cse2 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In425540149, ~y~0=~y~0_In425540149, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In425540149, ~y$w_buff1_used~0=~y$w_buff1_used~0_In425540149} OutVars{~y$w_buff1~0=~y$w_buff1~0_In425540149, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out425540149|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out425540149|, ~y~0=~y~0_In425540149, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In425540149, ~y$w_buff1_used~0=~y$w_buff1_used~0_In425540149} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 15:09:53,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1637027164 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1637027164 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1637027164|)) (and (= ~y$w_buff0_used~0_In-1637027164 |ULTIMATE.start_main_#t~ite20_Out-1637027164|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1637027164, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1637027164} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1637027164, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1637027164, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1637027164|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 15:09:53,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In461878434 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In461878434 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In461878434 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In461878434 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In461878434 |ULTIMATE.start_main_#t~ite21_Out461878434|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite21_Out461878434|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In461878434, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In461878434, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In461878434, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461878434} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In461878434, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In461878434, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out461878434|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In461878434, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461878434} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 15:09:53,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In111151249 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In111151249 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out111151249|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In111151249 |ULTIMATE.start_main_#t~ite22_Out111151249|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In111151249, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In111151249} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In111151249, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In111151249, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out111151249|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 15:09:53,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In288526506 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In288526506 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In288526506 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In288526506 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out288526506|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out288526506| ~y$r_buff1_thd0~0_In288526506) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In288526506, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In288526506, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In288526506, ~y$w_buff1_used~0=~y$w_buff1_used~0_In288526506} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In288526506, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In288526506, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In288526506, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out288526506|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In288526506} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 15:09:53,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L827-->L827-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In772226965 256)))) (or (and (= ~y$w_buff1_used~0_In772226965 |ULTIMATE.start_main_#t~ite39_Out772226965|) (= |ULTIMATE.start_main_#t~ite38_In772226965| |ULTIMATE.start_main_#t~ite38_Out772226965|) (not .cse0)) (and (= ~y$w_buff1_used~0_In772226965 |ULTIMATE.start_main_#t~ite38_Out772226965|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In772226965 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In772226965 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In772226965 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In772226965 256)))) .cse0 (= |ULTIMATE.start_main_#t~ite39_Out772226965| |ULTIMATE.start_main_#t~ite38_Out772226965|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In772226965, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In772226965, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In772226965|, ~weak$$choice2~0=~weak$$choice2~0_In772226965, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In772226965, ~y$w_buff1_used~0=~y$w_buff1_used~0_In772226965} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In772226965, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out772226965|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In772226965, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out772226965|, ~weak$$choice2~0=~weak$$choice2~0_In772226965, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In772226965, ~y$w_buff1_used~0=~y$w_buff1_used~0_In772226965} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 15:09:53,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L828-->L829: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 15:09:53,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L831-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_10) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_12 256)) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_99, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:09:53,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 15:09:54,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:09:54 BasicIcfg [2019-12-18 15:09:54,008 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:09:54,010 INFO L168 Benchmark]: Toolchain (without parser) took 21583.22 ms. Allocated memory was 144.2 MB in the beginning and 877.7 MB in the end (delta: 733.5 MB). Free memory was 100.2 MB in the beginning and 371.2 MB in the end (delta: -271.0 MB). Peak memory consumption was 462.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:54,011 INFO L168 Benchmark]: CDTParser took 1.51 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 15:09:54,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.22 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 99.8 MB in the beginning and 156.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:54,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.98 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:54,013 INFO L168 Benchmark]: Boogie Preprocessor took 37.26 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:54,013 INFO L168 Benchmark]: RCFGBuilder took 798.96 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 105.2 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:54,014 INFO L168 Benchmark]: TraceAbstraction took 19904.75 ms. Allocated memory was 202.9 MB in the beginning and 877.7 MB in the end (delta: 674.8 MB). Free memory was 104.5 MB in the beginning and 371.2 MB in the end (delta: -266.7 MB). Peak memory consumption was 408.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:09:54,018 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.51 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.22 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 99.8 MB in the beginning and 156.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.98 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.26 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 798.96 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 105.2 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19904.75 ms. Allocated memory was 202.9 MB in the beginning and 877.7 MB in the end (delta: 674.8 MB). Free memory was 104.5 MB in the beginning and 371.2 MB in the end (delta: -266.7 MB). Peak memory consumption was 408.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 24 ChoiceCompositions, 4225 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 48124 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t2522, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t2523, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] FCALL, FORK 0 pthread_create(&t2524, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L770] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L771] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L772] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L773] 3 y$r_buff0_thd3 = (_Bool)1 [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L744] 2 x = 1 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L779] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L780] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L812] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L813] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L815] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L819] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 0 y$flush_delayed = weak$$choice2 [L822] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1616 SDtfs, 1671 SDslu, 4612 SDs, 0 SdLazy, 3203 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 35 SyntacticMatches, 14 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22206occurred 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: 4.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 3835 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 672 ConstructedInterpolants, 0 QuantifiedInterpolants, 144277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...