/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/safe008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:34:10,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:34:10,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:34:10,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:34:10,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:34:10,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:34:10,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:34:10,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:34:10,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:34:10,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:34:10,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:34:10,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:34:10,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:34:10,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:34:10,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:34:10,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:34:10,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:34:10,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:34:10,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:34:10,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:34:10,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:34:10,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:34:10,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:34:10,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:34:10,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:34:10,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:34:10,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:34:10,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:34:10,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:34:10,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:34:10,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:34:10,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:34:10,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:34:10,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:34:10,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:34:10,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:34:10,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:34:10,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:34:10,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:34:10,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:34:10,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:34:10,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:34:10,216 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:34:10,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:34:10,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:34:10,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:34:10,221 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:34:10,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:34:10,222 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:34:10,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:34:10,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:34:10,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:34:10,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:34:10,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:34:10,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:34:10,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:34:10,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:34:10,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:34:10,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:34:10,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:34:10,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:34:10,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:34:10,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:34:10,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:34:10,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:34:10,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:34:10,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:34:10,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:34:10,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:34:10,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:34:10,230 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:34:10,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:34:10,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:34:10,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:34:10,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:34:10,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:34:10,565 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:34:10,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2019-12-18 14:34:10,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/412c1a01f/973b73985c984f8eac2b0d128c43d64f/FLAG2f3bcbe5c [2019-12-18 14:34:11,181 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:34:11,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2019-12-18 14:34:11,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/412c1a01f/973b73985c984f8eac2b0d128c43d64f/FLAG2f3bcbe5c [2019-12-18 14:34:11,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/412c1a01f/973b73985c984f8eac2b0d128c43d64f [2019-12-18 14:34:11,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:34:11,520 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:34:11,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:34:11,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:34:11,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:34:11,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:34:11" (1/1) ... [2019-12-18 14:34:11,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69037232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:11, skipping insertion in model container [2019-12-18 14:34:11,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:34:11" (1/1) ... [2019-12-18 14:34:11,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:34:11,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:34:12,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:34:12,145 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:34:12,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:34:12,283 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:34:12,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12 WrapperNode [2019-12-18 14:34:12,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:34:12,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:34:12,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:34:12,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:34:12,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12" (1/1) ... [2019-12-18 14:34:12,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12" (1/1) ... [2019-12-18 14:34:12,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:34:12,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:34:12,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:34:12,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:34:12,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12" (1/1) ... [2019-12-18 14:34:12,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12" (1/1) ... [2019-12-18 14:34:12,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12" (1/1) ... [2019-12-18 14:34:12,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12" (1/1) ... [2019-12-18 14:34:12,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12" (1/1) ... [2019-12-18 14:34:12,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12" (1/1) ... [2019-12-18 14:34:12,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12" (1/1) ... [2019-12-18 14:34:12,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:34:12,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:34:12,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:34:12,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:34:12,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:34:12,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:34:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:34:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:34:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:34:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:34:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:34:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:34:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:34:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:34:12,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:34:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:34:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:34:12,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:34:12,472 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:34:13,185 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:34:13,185 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:34:13,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:34:13 BoogieIcfgContainer [2019-12-18 14:34:13,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:34:13,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:34:13,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:34:13,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:34:13,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:34:11" (1/3) ... [2019-12-18 14:34:13,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126ac487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:34:13, skipping insertion in model container [2019-12-18 14:34:13,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:12" (2/3) ... [2019-12-18 14:34:13,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126ac487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:34:13, skipping insertion in model container [2019-12-18 14:34:13,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:34:13" (3/3) ... [2019-12-18 14:34:13,197 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc.i [2019-12-18 14:34:13,208 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:34:13,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:34:13,217 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:34:13,218 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:34:13,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,259 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,259 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,260 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,260 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,261 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,293 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,293 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,304 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,305 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,307 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,308 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,311 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,312 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:13,328 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:34:13,349 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:34:13,350 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:34:13,350 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:34:13,350 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:34:13,350 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:34:13,350 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:34:13,350 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:34:13,351 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:34:13,367 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 14:34:13,369 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 14:34:13,454 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 14:34:13,455 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:34:13,476 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:34:13,510 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 14:34:13,558 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 14:34:13,558 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:34:13,570 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:34:13,596 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 14:34:13,598 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:34:18,249 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:34:18,370 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:34:18,397 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80053 [2019-12-18 14:34:18,397 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 14:34:18,401 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-18 14:34:36,858 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-18 14:34:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-18 14:34:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:34:36,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:36,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:34:36,865 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:36,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:36,870 INFO L82 PathProgramCache]: Analyzing trace with hash 846448, now seen corresponding path program 1 times [2019-12-18 14:34:36,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:36,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648447073] [2019-12-18 14:34:36,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:34:37,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648447073] [2019-12-18 14:34:37,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:37,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:34:37,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987899234] [2019-12-18 14:34:37,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:34:37,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:37,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:34:37,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:37,125 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-18 14:34:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:39,948 INFO L93 Difference]: Finished difference Result 115182 states and 492924 transitions. [2019-12-18 14:34:39,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:34:39,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:34:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:40,812 INFO L225 Difference]: With dead ends: 115182 [2019-12-18 14:34:40,812 INFO L226 Difference]: Without dead ends: 112830 [2019-12-18 14:34:40,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112830 states. [2019-12-18 14:34:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112830 to 112830. [2019-12-18 14:34:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112830 states. [2019-12-18 14:34:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112830 states to 112830 states and 483320 transitions. [2019-12-18 14:34:50,288 INFO L78 Accepts]: Start accepts. Automaton has 112830 states and 483320 transitions. Word has length 3 [2019-12-18 14:34:50,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:50,289 INFO L462 AbstractCegarLoop]: Abstraction has 112830 states and 483320 transitions. [2019-12-18 14:34:50,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:34:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 112830 states and 483320 transitions. [2019-12-18 14:34:50,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:34:50,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:50,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:50,294 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:50,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash -939919620, now seen corresponding path program 1 times [2019-12-18 14:34:50,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:50,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866337074] [2019-12-18 14:34:50,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:34:50,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866337074] [2019-12-18 14:34:50,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:50,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:34:50,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073729504] [2019-12-18 14:34:50,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:34:50,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:50,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:34:50,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:34:50,404 INFO L87 Difference]: Start difference. First operand 112830 states and 483320 transitions. Second operand 4 states. [2019-12-18 14:34:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:55,595 INFO L93 Difference]: Finished difference Result 176302 states and 727515 transitions. [2019-12-18 14:34:55,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:34:55,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:34:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:56,816 INFO L225 Difference]: With dead ends: 176302 [2019-12-18 14:34:56,817 INFO L226 Difference]: Without dead ends: 176253 [2019-12-18 14:34:56,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176253 states. [2019-12-18 14:35:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176253 to 159436. [2019-12-18 14:35:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159436 states. [2019-12-18 14:35:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159436 states to 159436 states and 665691 transitions. [2019-12-18 14:35:09,152 INFO L78 Accepts]: Start accepts. Automaton has 159436 states and 665691 transitions. Word has length 11 [2019-12-18 14:35:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:09,153 INFO L462 AbstractCegarLoop]: Abstraction has 159436 states and 665691 transitions. [2019-12-18 14:35:09,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:35:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 159436 states and 665691 transitions. [2019-12-18 14:35:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:35:09,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:09,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:09,160 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:09,160 INFO L82 PathProgramCache]: Analyzing trace with hash 670018080, now seen corresponding path program 1 times [2019-12-18 14:35:09,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:09,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583167938] [2019-12-18 14:35:09,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:09,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583167938] [2019-12-18 14:35:09,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:09,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:09,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382696068] [2019-12-18 14:35:09,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:35:09,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:09,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:35:09,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:35:09,266 INFO L87 Difference]: Start difference. First operand 159436 states and 665691 transitions. Second operand 4 states. [2019-12-18 14:35:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:15,927 INFO L93 Difference]: Finished difference Result 228428 states and 932375 transitions. [2019-12-18 14:35:15,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:35:15,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:35:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:16,816 INFO L225 Difference]: With dead ends: 228428 [2019-12-18 14:35:16,817 INFO L226 Difference]: Without dead ends: 228365 [2019-12-18 14:35:16,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228365 states. [2019-12-18 14:35:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228365 to 192396. [2019-12-18 14:35:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192396 states. [2019-12-18 14:35:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192396 states to 192396 states and 797806 transitions. [2019-12-18 14:35:34,820 INFO L78 Accepts]: Start accepts. Automaton has 192396 states and 797806 transitions. Word has length 13 [2019-12-18 14:35:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:34,821 INFO L462 AbstractCegarLoop]: Abstraction has 192396 states and 797806 transitions. [2019-12-18 14:35:34,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:35:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 192396 states and 797806 transitions. [2019-12-18 14:35:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:35:34,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:34,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:34,825 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:34,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:34,825 INFO L82 PathProgramCache]: Analyzing trace with hash -293312110, now seen corresponding path program 1 times [2019-12-18 14:35:34,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:34,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124069751] [2019-12-18 14:35:34,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:34,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124069751] [2019-12-18 14:35:34,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:34,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:34,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691429666] [2019-12-18 14:35:34,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:34,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:34,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:34,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:34,896 INFO L87 Difference]: Start difference. First operand 192396 states and 797806 transitions. Second operand 3 states. [2019-12-18 14:35:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:35,036 INFO L93 Difference]: Finished difference Result 38255 states and 124332 transitions. [2019-12-18 14:35:35,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:35,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:35:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:35,110 INFO L225 Difference]: With dead ends: 38255 [2019-12-18 14:35:35,110 INFO L226 Difference]: Without dead ends: 38255 [2019-12-18 14:35:35,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38255 states. [2019-12-18 14:35:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38255 to 38255. [2019-12-18 14:35:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38255 states. [2019-12-18 14:35:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 124332 transitions. [2019-12-18 14:35:37,160 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 124332 transitions. Word has length 13 [2019-12-18 14:35:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:37,160 INFO L462 AbstractCegarLoop]: Abstraction has 38255 states and 124332 transitions. [2019-12-18 14:35:37,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 124332 transitions. [2019-12-18 14:35:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:35:37,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:37,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:37,164 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:37,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2105368373, now seen corresponding path program 1 times [2019-12-18 14:35:37,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:37,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629386746] [2019-12-18 14:35:37,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:37,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629386746] [2019-12-18 14:35:37,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:37,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:35:37,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527376963] [2019-12-18 14:35:37,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:37,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:37,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:37,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:37,289 INFO L87 Difference]: Start difference. First operand 38255 states and 124332 transitions. Second operand 5 states. [2019-12-18 14:35:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:38,087 INFO L93 Difference]: Finished difference Result 51712 states and 164813 transitions. [2019-12-18 14:35:38,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:35:38,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:35:38,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:38,168 INFO L225 Difference]: With dead ends: 51712 [2019-12-18 14:35:38,168 INFO L226 Difference]: Without dead ends: 51699 [2019-12-18 14:35:38,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:35:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51699 states. [2019-12-18 14:35:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51699 to 38713. [2019-12-18 14:35:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38713 states. [2019-12-18 14:35:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38713 states to 38713 states and 125630 transitions. [2019-12-18 14:35:39,927 INFO L78 Accepts]: Start accepts. Automaton has 38713 states and 125630 transitions. Word has length 19 [2019-12-18 14:35:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:39,928 INFO L462 AbstractCegarLoop]: Abstraction has 38713 states and 125630 transitions. [2019-12-18 14:35:39,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 38713 states and 125630 transitions. [2019-12-18 14:35:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:35:39,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:39,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:39,942 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:39,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:39,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1240477865, now seen corresponding path program 1 times [2019-12-18 14:35:39,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:39,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231083404] [2019-12-18 14:35:39,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:40,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231083404] [2019-12-18 14:35:40,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:40,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:35:40,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313112461] [2019-12-18 14:35:40,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:35:40,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:40,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:35:40,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:35:40,058 INFO L87 Difference]: Start difference. First operand 38713 states and 125630 transitions. Second operand 4 states. [2019-12-18 14:35:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:40,092 INFO L93 Difference]: Finished difference Result 7422 states and 20312 transitions. [2019-12-18 14:35:40,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:35:40,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:35:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:40,103 INFO L225 Difference]: With dead ends: 7422 [2019-12-18 14:35:40,103 INFO L226 Difference]: Without dead ends: 7422 [2019-12-18 14:35:40,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:35:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2019-12-18 14:35:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 7310. [2019-12-18 14:35:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2019-12-18 14:35:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 19992 transitions. [2019-12-18 14:35:40,195 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 19992 transitions. Word has length 25 [2019-12-18 14:35:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:40,196 INFO L462 AbstractCegarLoop]: Abstraction has 7310 states and 19992 transitions. [2019-12-18 14:35:40,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:35:40,196 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 19992 transitions. [2019-12-18 14:35:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:35:40,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:40,208 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] [2019-12-18 14:35:40,208 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:40,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:40,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1041968244, now seen corresponding path program 1 times [2019-12-18 14:35:40,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:40,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859986703] [2019-12-18 14:35:40,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:40,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859986703] [2019-12-18 14:35:40,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:40,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:35:40,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697155707] [2019-12-18 14:35:40,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:40,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:40,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:40,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:40,292 INFO L87 Difference]: Start difference. First operand 7310 states and 19992 transitions. Second operand 5 states. [2019-12-18 14:35:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:40,331 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-18 14:35:40,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:35:40,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:35:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:40,339 INFO L225 Difference]: With dead ends: 5312 [2019-12-18 14:35:40,340 INFO L226 Difference]: Without dead ends: 5312 [2019-12-18 14:35:40,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-18 14:35:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-18 14:35:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-18 14:35:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-18 14:35:40,427 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-18 14:35:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:40,428 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-18 14:35:40,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-18 14:35:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:35:40,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:40,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:40,438 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1019045356, now seen corresponding path program 1 times [2019-12-18 14:35:40,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:40,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859077968] [2019-12-18 14:35:40,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:40,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859077968] [2019-12-18 14:35:40,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:40,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:35:40,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518844390] [2019-12-18 14:35:40,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:40,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:40,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:40,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:40,554 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 5 states. [2019-12-18 14:35:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:40,859 INFO L93 Difference]: Finished difference Result 7539 states and 21548 transitions. [2019-12-18 14:35:40,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:35:40,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 14:35:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:40,871 INFO L225 Difference]: With dead ends: 7539 [2019-12-18 14:35:40,871 INFO L226 Difference]: Without dead ends: 7539 [2019-12-18 14:35:40,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:35:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-18 14:35:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 6345. [2019-12-18 14:35:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2019-12-18 14:35:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 18318 transitions. [2019-12-18 14:35:40,978 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 18318 transitions. Word has length 65 [2019-12-18 14:35:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:40,978 INFO L462 AbstractCegarLoop]: Abstraction has 6345 states and 18318 transitions. [2019-12-18 14:35:40,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 18318 transitions. [2019-12-18 14:35:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:35:40,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:40,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:40,988 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:40,988 INFO L82 PathProgramCache]: Analyzing trace with hash -613444874, now seen corresponding path program 2 times [2019-12-18 14:35:40,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:40,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870713760] [2019-12-18 14:35:40,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:41,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870713760] [2019-12-18 14:35:41,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:41,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:41,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773001146] [2019-12-18 14:35:41,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:41,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:41,113 INFO L87 Difference]: Start difference. First operand 6345 states and 18318 transitions. Second operand 3 states. [2019-12-18 14:35:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:41,144 INFO L93 Difference]: Finished difference Result 5975 states and 16977 transitions. [2019-12-18 14:35:41,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:41,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:35:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:41,153 INFO L225 Difference]: With dead ends: 5975 [2019-12-18 14:35:41,153 INFO L226 Difference]: Without dead ends: 5975 [2019-12-18 14:35:41,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2019-12-18 14:35:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5819. [2019-12-18 14:35:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5819 states. [2019-12-18 14:35:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5819 states to 5819 states and 16547 transitions. [2019-12-18 14:35:41,245 INFO L78 Accepts]: Start accepts. Automaton has 5819 states and 16547 transitions. Word has length 65 [2019-12-18 14:35:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:41,246 INFO L462 AbstractCegarLoop]: Abstraction has 5819 states and 16547 transitions. [2019-12-18 14:35:41,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 5819 states and 16547 transitions. [2019-12-18 14:35:41,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:35:41,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:41,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:41,255 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:41,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:41,255 INFO L82 PathProgramCache]: Analyzing trace with hash 223341978, now seen corresponding path program 1 times [2019-12-18 14:35:41,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:41,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561853312] [2019-12-18 14:35:41,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:41,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561853312] [2019-12-18 14:35:41,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:41,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:35:41,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050648295] [2019-12-18 14:35:41,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:41,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:41,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:41,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:41,359 INFO L87 Difference]: Start difference. First operand 5819 states and 16547 transitions. Second operand 5 states. [2019-12-18 14:35:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:41,683 INFO L93 Difference]: Finished difference Result 8394 states and 23622 transitions. [2019-12-18 14:35:41,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:35:41,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 14:35:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:41,695 INFO L225 Difference]: With dead ends: 8394 [2019-12-18 14:35:41,695 INFO L226 Difference]: Without dead ends: 8394 [2019-12-18 14:35:41,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:35:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8394 states. [2019-12-18 14:35:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8394 to 6167. [2019-12-18 14:35:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6167 states. [2019-12-18 14:35:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 17580 transitions. [2019-12-18 14:35:41,789 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 17580 transitions. Word has length 66 [2019-12-18 14:35:41,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:41,790 INFO L462 AbstractCegarLoop]: Abstraction has 6167 states and 17580 transitions. [2019-12-18 14:35:41,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 17580 transitions. [2019-12-18 14:35:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:35:41,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:41,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:41,798 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:41,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:41,799 INFO L82 PathProgramCache]: Analyzing trace with hash -446701502, now seen corresponding path program 2 times [2019-12-18 14:35:41,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:41,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84189189] [2019-12-18 14:35:41,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:41,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84189189] [2019-12-18 14:35:41,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:41,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:41,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291425543] [2019-12-18 14:35:41,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:41,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:41,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:41,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:41,873 INFO L87 Difference]: Start difference. First operand 6167 states and 17580 transitions. Second operand 3 states. [2019-12-18 14:35:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:41,905 INFO L93 Difference]: Finished difference Result 5518 states and 15469 transitions. [2019-12-18 14:35:41,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:41,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:35:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:41,913 INFO L225 Difference]: With dead ends: 5518 [2019-12-18 14:35:41,913 INFO L226 Difference]: Without dead ends: 5518 [2019-12-18 14:35:41,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2019-12-18 14:35:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 5170. [2019-12-18 14:35:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-12-18 14:35:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 14519 transitions. [2019-12-18 14:35:41,997 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 14519 transitions. Word has length 66 [2019-12-18 14:35:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:41,997 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 14519 transitions. [2019-12-18 14:35:41,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 14519 transitions. [2019-12-18 14:35:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:35:42,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:42,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:42,004 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:42,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:42,004 INFO L82 PathProgramCache]: Analyzing trace with hash 991626200, now seen corresponding path program 1 times [2019-12-18 14:35:42,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:42,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956484737] [2019-12-18 14:35:42,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:43,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956484737] [2019-12-18 14:35:43,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:43,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:35:43,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31249191] [2019-12-18 14:35:43,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:35:43,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:43,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:35:43,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:35:43,609 INFO L87 Difference]: Start difference. First operand 5170 states and 14519 transitions. Second operand 8 states. [2019-12-18 14:35:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:44,595 INFO L93 Difference]: Finished difference Result 7557 states and 21020 transitions. [2019-12-18 14:35:44,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:35:44,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-18 14:35:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:44,606 INFO L225 Difference]: With dead ends: 7557 [2019-12-18 14:35:44,606 INFO L226 Difference]: Without dead ends: 7557 [2019-12-18 14:35:44,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:35:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7557 states. [2019-12-18 14:35:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7557 to 5613. [2019-12-18 14:35:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-12-18 14:35:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 15757 transitions. [2019-12-18 14:35:44,690 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 15757 transitions. Word has length 67 [2019-12-18 14:35:44,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:44,690 INFO L462 AbstractCegarLoop]: Abstraction has 5613 states and 15757 transitions. [2019-12-18 14:35:44,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:35:44,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 15757 transitions. [2019-12-18 14:35:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:35:44,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:44,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:44,698 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:44,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:44,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1617265986, now seen corresponding path program 2 times [2019-12-18 14:35:44,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:44,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948479699] [2019-12-18 14:35:44,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:44,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948479699] [2019-12-18 14:35:44,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:44,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:44,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012213751] [2019-12-18 14:35:44,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:44,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:44,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:44,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:44,796 INFO L87 Difference]: Start difference. First operand 5613 states and 15757 transitions. Second operand 3 states. [2019-12-18 14:35:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:44,853 INFO L93 Difference]: Finished difference Result 5612 states and 15755 transitions. [2019-12-18 14:35:44,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:44,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 14:35:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:44,861 INFO L225 Difference]: With dead ends: 5612 [2019-12-18 14:35:44,861 INFO L226 Difference]: Without dead ends: 5612 [2019-12-18 14:35:44,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2019-12-18 14:35:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 2982. [2019-12-18 14:35:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-12-18 14:35:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 8451 transitions. [2019-12-18 14:35:44,938 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 8451 transitions. Word has length 67 [2019-12-18 14:35:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:44,938 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 8451 transitions. [2019-12-18 14:35:44,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 8451 transitions. [2019-12-18 14:35:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:44,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:44,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:44,943 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:44,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:44,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1277219082, now seen corresponding path program 1 times [2019-12-18 14:35:44,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:44,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220743511] [2019-12-18 14:35:44,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:45,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220743511] [2019-12-18 14:35:45,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:45,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:35:45,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113433626] [2019-12-18 14:35:45,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:35:45,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:45,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:35:45,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:35:45,077 INFO L87 Difference]: Start difference. First operand 2982 states and 8451 transitions. Second operand 7 states. [2019-12-18 14:35:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:45,168 INFO L93 Difference]: Finished difference Result 5679 states and 16084 transitions. [2019-12-18 14:35:45,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:35:45,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-18 14:35:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:45,174 INFO L225 Difference]: With dead ends: 5679 [2019-12-18 14:35:45,174 INFO L226 Difference]: Without dead ends: 3281 [2019-12-18 14:35:45,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:35:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2019-12-18 14:35:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 2810. [2019-12-18 14:35:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-18 14:35:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 7936 transitions. [2019-12-18 14:35:45,216 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 7936 transitions. Word has length 68 [2019-12-18 14:35:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:45,216 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 7936 transitions. [2019-12-18 14:35:45,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:35:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 7936 transitions. [2019-12-18 14:35:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:45,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:45,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:45,221 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1090372922, now seen corresponding path program 2 times [2019-12-18 14:35:45,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:45,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068769007] [2019-12-18 14:35:45,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:45,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068769007] [2019-12-18 14:35:45,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:45,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:35:45,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288206361] [2019-12-18 14:35:45,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:35:45,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:45,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:35:45,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:35:45,476 INFO L87 Difference]: Start difference. First operand 2810 states and 7936 transitions. Second operand 13 states. [2019-12-18 14:35:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:46,062 INFO L93 Difference]: Finished difference Result 5560 states and 15685 transitions. [2019-12-18 14:35:46,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:35:46,062 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 14:35:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:46,071 INFO L225 Difference]: With dead ends: 5560 [2019-12-18 14:35:46,071 INFO L226 Difference]: Without dead ends: 5535 [2019-12-18 14:35:46,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-18 14:35:46,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-12-18 14:35:46,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 3941. [2019-12-18 14:35:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-12-18 14:35:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 11030 transitions. [2019-12-18 14:35:46,134 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 11030 transitions. Word has length 68 [2019-12-18 14:35:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:46,135 INFO L462 AbstractCegarLoop]: Abstraction has 3941 states and 11030 transitions. [2019-12-18 14:35:46,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:35:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 11030 transitions. [2019-12-18 14:35:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:46,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:46,140 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:46,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1311051616, now seen corresponding path program 3 times [2019-12-18 14:35:46,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:46,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106409843] [2019-12-18 14:35:46,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:46,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106409843] [2019-12-18 14:35:46,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:46,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:35:46,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591029174] [2019-12-18 14:35:46,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:35:46,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:46,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:35:46,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:35:46,428 INFO L87 Difference]: Start difference. First operand 3941 states and 11030 transitions. Second operand 13 states. [2019-12-18 14:35:47,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:47,210 INFO L93 Difference]: Finished difference Result 6127 states and 17103 transitions. [2019-12-18 14:35:47,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:35:47,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 14:35:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:47,219 INFO L225 Difference]: With dead ends: 6127 [2019-12-18 14:35:47,219 INFO L226 Difference]: Without dead ends: 6102 [2019-12-18 14:35:47,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:35:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2019-12-18 14:35:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 4162. [2019-12-18 14:35:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2019-12-18 14:35:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 11668 transitions. [2019-12-18 14:35:47,318 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 11668 transitions. Word has length 68 [2019-12-18 14:35:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:47,318 INFO L462 AbstractCegarLoop]: Abstraction has 4162 states and 11668 transitions. [2019-12-18 14:35:47,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:35:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 11668 transitions. [2019-12-18 14:35:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:47,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:47,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:47,332 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:47,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:47,332 INFO L82 PathProgramCache]: Analyzing trace with hash -526111866, now seen corresponding path program 4 times [2019-12-18 14:35:47,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:47,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712975846] [2019-12-18 14:35:47,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:47,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712975846] [2019-12-18 14:35:47,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:47,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:35:47,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385066992] [2019-12-18 14:35:47,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:35:47,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:47,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:35:47,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:35:47,701 INFO L87 Difference]: Start difference. First operand 4162 states and 11668 transitions. Second operand 15 states. [2019-12-18 14:35:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:49,080 INFO L93 Difference]: Finished difference Result 8429 states and 23611 transitions. [2019-12-18 14:35:49,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 14:35:49,081 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-18 14:35:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:49,093 INFO L225 Difference]: With dead ends: 8429 [2019-12-18 14:35:49,093 INFO L226 Difference]: Without dead ends: 8404 [2019-12-18 14:35:49,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=1367, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 14:35:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8404 states. [2019-12-18 14:35:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8404 to 4378. [2019-12-18 14:35:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4378 states. [2019-12-18 14:35:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 12298 transitions. [2019-12-18 14:35:49,183 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 12298 transitions. Word has length 68 [2019-12-18 14:35:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:49,183 INFO L462 AbstractCegarLoop]: Abstraction has 4378 states and 12298 transitions. [2019-12-18 14:35:49,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:35:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 12298 transitions. [2019-12-18 14:35:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:49,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:49,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:49,188 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:49,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:49,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1379923308, now seen corresponding path program 5 times [2019-12-18 14:35:49,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:49,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683184893] [2019-12-18 14:35:49,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:49,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683184893] [2019-12-18 14:35:49,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:49,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:35:49,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399945291] [2019-12-18 14:35:49,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:35:49,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:49,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:35:49,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:35:49,458 INFO L87 Difference]: Start difference. First operand 4378 states and 12298 transitions. Second operand 15 states. [2019-12-18 14:35:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:50,496 INFO L93 Difference]: Finished difference Result 6118 states and 16978 transitions. [2019-12-18 14:35:50,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:35:50,496 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-18 14:35:50,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:50,505 INFO L225 Difference]: With dead ends: 6118 [2019-12-18 14:35:50,506 INFO L226 Difference]: Without dead ends: 6093 [2019-12-18 14:35:50,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 14:35:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2019-12-18 14:35:50,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 4062. [2019-12-18 14:35:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-12-18 14:35:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 11322 transitions. [2019-12-18 14:35:50,580 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 11322 transitions. Word has length 68 [2019-12-18 14:35:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:50,580 INFO L462 AbstractCegarLoop]: Abstraction has 4062 states and 11322 transitions. [2019-12-18 14:35:50,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:35:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 11322 transitions. [2019-12-18 14:35:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:50,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:50,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:50,585 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:50,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:50,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2056032048, now seen corresponding path program 6 times [2019-12-18 14:35:50,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:50,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421186452] [2019-12-18 14:35:50,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:35:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:35:50,714 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:35:50,714 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:35:50,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= |v_ULTIMATE.start_main_~#t1961~0.offset_17| 0) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1961~0.base_23|) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1961~0.base_23| 4)) (= |v_#NULL.offset_3| 0) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= v_~z$w_buff1_used~0_381 0) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1961~0.base_23|)) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1961~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1961~0.base_23|) |v_ULTIMATE.start_main_~#t1961~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~z$flush_delayed~0_41) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1961~0.base_23| 1)) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_111 0) (= v_~z$r_buff0_thd2~0_100 0) (= v_~z$r_buff1_thd2~0_185 0) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_~#t1961~0.offset=|v_ULTIMATE.start_main_~#t1961~0.offset_17|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_~#t1963~0.base=|v_ULTIMATE.start_main_~#t1963~0.base_20|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1963~0.offset=|v_ULTIMATE.start_main_~#t1963~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ULTIMATE.start_main_~#t1962~0.base=|v_ULTIMATE.start_main_~#t1962~0.base_21|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_~#t1961~0.base=|v_ULTIMATE.start_main_~#t1961~0.base_23|, ULTIMATE.start_main_~#t1962~0.offset=|v_ULTIMATE.start_main_~#t1962~0.offset_16|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1961~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1963~0.base, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1963~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1962~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1961~0.base, ULTIMATE.start_main_~#t1962~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, 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, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:35:50,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1962~0.base_11| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1962~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1962~0.base_11|) |v_ULTIMATE.start_main_~#t1962~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1962~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1962~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1962~0.offset_10|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1962~0.base_11|)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1962~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1962~0.offset=|v_ULTIMATE.start_main_~#t1962~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1962~0.base=|v_ULTIMATE.start_main_~#t1962~0.base_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1962~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1962~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 14:35:50,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 0 (mod v_~z$w_buff1_used~0_97 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_~z$w_buff0_used~0_206 1) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 14:35:50,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1963~0.base_12|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1963~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1963~0.base_12|) |v_ULTIMATE.start_main_~#t1963~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1963~0.base_12| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1963~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1963~0.base_12| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1963~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t1963~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1963~0.offset=|v_ULTIMATE.start_main_~#t1963~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1963~0.base=|v_ULTIMATE.start_main_~#t1963~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1963~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1963~0.base] because there is no mapped edge [2019-12-18 14:35:50,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In58954699 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In58954699 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In58954699 |P0Thread1of1ForFork0_#t~ite5_Out58954699|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out58954699|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In58954699, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In58954699} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out58954699|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In58954699, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In58954699} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:35:50,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In1746682369 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1746682369 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1746682369 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1746682369 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1746682369|)) (and (= ~z$w_buff1_used~0_In1746682369 |P0Thread1of1ForFork0_#t~ite6_Out1746682369|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1746682369, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1746682369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1746682369, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1746682369} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1746682369|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1746682369, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1746682369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1746682369, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1746682369} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:35:50,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1821981268 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1821981268 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out1821981268 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out1821981268 ~z$r_buff0_thd1~0_In1821981268)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1821981268, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1821981268} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1821981268, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1821981268|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1821981268} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:35:50,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1691915636 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1691915636 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1691915636 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1691915636 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1691915636|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In1691915636 |P0Thread1of1ForFork0_#t~ite8_Out1691915636|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1691915636, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1691915636, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1691915636, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1691915636} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1691915636, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1691915636|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1691915636, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1691915636, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1691915636} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:35:50,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:35:50,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In652375342 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In652375342 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In652375342 |P1Thread1of1ForFork1_#t~ite9_Out652375342|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out652375342| ~z~0_In652375342) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In652375342, ~z$w_buff1_used~0=~z$w_buff1_used~0_In652375342, ~z$w_buff1~0=~z$w_buff1~0_In652375342, ~z~0=~z~0_In652375342} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out652375342|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In652375342, ~z$w_buff1_used~0=~z$w_buff1_used~0_In652375342, ~z$w_buff1~0=~z$w_buff1~0_In652375342, ~z~0=~z~0_In652375342} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 14:35:50,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_16|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_16|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_15|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_21|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 14:35:50,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-821088008 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-821088008 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-821088008| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-821088008| ~z$w_buff0_used~0_In-821088008)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-821088008, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-821088008} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-821088008, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-821088008|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-821088008} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:35:50,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-395426080 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-395426080 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-395426080| ~z~0_In-395426080)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-395426080| ~z$w_buff1~0_In-395426080) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-395426080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-395426080, ~z$w_buff1~0=~z$w_buff1~0_In-395426080, ~z~0=~z~0_In-395426080} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-395426080|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-395426080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-395426080, ~z$w_buff1~0=~z$w_buff1~0_In-395426080, ~z~0=~z~0_In-395426080} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 14:35:50,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1627396022 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In1627396022 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1627396022 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1627396022 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1627396022 |P1Thread1of1ForFork1_#t~ite12_Out1627396022|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1627396022|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1627396022, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1627396022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1627396022, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1627396022} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1627396022, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1627396022, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1627396022, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1627396022|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1627396022} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:35:50,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In242828090 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In242828090 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out242828090|)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out242828090| ~z$r_buff0_thd2~0_In242828090) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In242828090, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In242828090} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In242828090, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out242828090|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In242828090} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:35:50,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= v_~z~0_45 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 14:35:50,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1957505337 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1957505337 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out1957505337| ~z$w_buff0_used~0_In1957505337)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out1957505337| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1957505337, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1957505337} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1957505337, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1957505337, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1957505337|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:35:50,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1458454374 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1458454374 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1458454374 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1458454374 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1458454374 |P2Thread1of1ForFork2_#t~ite18_Out-1458454374|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite18_Out-1458454374| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458454374, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1458454374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1458454374, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1458454374} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1458454374, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1458454374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1458454374, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1458454374, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1458454374|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 14:35:50,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1063461618 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1063461618 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1063461618|)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out1063461618| ~z$r_buff0_thd3~0_In1063461618) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1063461618, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1063461618} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1063461618, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1063461618, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1063461618|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 14:35:50,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1183218593 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1183218593 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1183218593 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1183218593 256)))) (or (and (= ~z$r_buff1_thd3~0_In1183218593 |P2Thread1of1ForFork2_#t~ite20_Out1183218593|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1183218593|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1183218593, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1183218593, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1183218593, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1183218593} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1183218593, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1183218593|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1183218593, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1183218593, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1183218593} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 14:35:50,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~z$r_buff1_thd3~0_66) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:35:50,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1424720739 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1424720739 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1424720739 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1424720739 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1424720739 |P1Thread1of1ForFork1_#t~ite14_Out-1424720739|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1424720739|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1424720739, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1424720739, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1424720739, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1424720739} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1424720739, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1424720739, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1424720739, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1424720739|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1424720739} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:35:50,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_54) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:35:50,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:35:50,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1207336230 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1207336230 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite24_Out1207336230| ~z$w_buff1~0_In1207336230) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite24_Out1207336230| ~z~0_In1207336230)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1207336230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207336230, ~z$w_buff1~0=~z$w_buff1~0_In1207336230, ~z~0=~z~0_In1207336230} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1207336230, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1207336230|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207336230, ~z$w_buff1~0=~z$w_buff1~0_In1207336230, ~z~0=~z~0_In1207336230} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 14:35:50,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-18 14:35:50,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-794279109 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-794279109 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-794279109| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-794279109| ~z$w_buff0_used~0_In-794279109)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-794279109, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-794279109} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-794279109, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-794279109, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-794279109|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 14:35:50,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2086620302 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In2086620302 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In2086620302 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In2086620302 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out2086620302| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In2086620302 |ULTIMATE.start_main_#t~ite27_Out2086620302|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2086620302, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2086620302, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2086620302, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2086620302} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2086620302, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2086620302, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2086620302, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2086620302, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out2086620302|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 14:35:50,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-690270586 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-690270586 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-690270586| ~z$r_buff0_thd0~0_In-690270586)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-690270586| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-690270586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-690270586} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-690270586, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-690270586|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-690270586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 14:35:50,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1489369673 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1489369673 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1489369673 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1489369673 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-1489369673| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-1489369673| ~z$r_buff1_thd0~0_In-1489369673) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1489369673, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489369673, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1489369673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489369673} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1489369673, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1489369673|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489369673, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1489369673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489369673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:35:50,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:35:50,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:35:50,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:35:50,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:35:50 BasicIcfg [2019-12-18 14:35:50,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:35:50,865 INFO L168 Benchmark]: Toolchain (without parser) took 99344.99 ms. Allocated memory was 139.5 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 101.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 856.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:35:50,866 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:35:50,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.04 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 101.2 MB in the beginning and 154.6 MB in the end (delta: -53.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:35:50,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.37 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:35:50,869 INFO L168 Benchmark]: Boogie Preprocessor took 49.45 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:35:50,869 INFO L168 Benchmark]: RCFGBuilder took 774.93 ms. Allocated memory is still 201.3 MB. Free memory was 149.3 MB in the beginning and 99.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:35:50,871 INFO L168 Benchmark]: TraceAbstraction took 97674.67 ms. Allocated memory was 201.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 792.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:35:50,880 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.04 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 101.2 MB in the beginning and 154.6 MB in the end (delta: -53.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.37 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.45 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 774.93 ms. Allocated memory is still 201.3 MB. Free memory was 149.3 MB in the beginning and 99.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97674.67 ms. Allocated memory was 201.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 792.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 106 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 5490 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 80053 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_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=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_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=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 97.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2718 SDtfs, 3561 SDslu, 8052 SDs, 0 SdLazy, 4205 SolverSat, 269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 29 SyntacticMatches, 15 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192396occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 84809 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 925 NumberOfCodeBlocks, 925 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 839 ConstructedInterpolants, 0 QuantifiedInterpolants, 264542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...