/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/mix049_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:44:37,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:44:37,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:44:37,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:44:37,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:44:37,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:44:37,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:44:37,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:44:37,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:44:37,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:44:37,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:44:37,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:44:37,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:44:37,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:44:37,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:44:37,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:44:37,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:44:37,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:44:37,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:44:37,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:44:37,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:44:37,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:44:37,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:44:37,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:44:37,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:44:37,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:44:37,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:44:37,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:44:37,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:44:37,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:44:37,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:44:37,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:44:37,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:44:37,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:44:37,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:44:37,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:44:37,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:44:37,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:44:37,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:44:37,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:44:37,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:44:37,227 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 13:44:37,259 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:44:37,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:44:37,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:44:37,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:44:37,264 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:44:37,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:44:37,265 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:44:37,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:44:37,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:44:37,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:44:37,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:44:37,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:44:37,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:44:37,268 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:44:37,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:44:37,268 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:44:37,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:44:37,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:44:37,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:44:37,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:44:37,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:44:37,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:44:37,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:44:37,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:44:37,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:44:37,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:44:37,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:44:37,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:44:37,272 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:44:37,273 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:44:37,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:44:37,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:44:37,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:44:37,581 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:44:37,581 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:44:37,582 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_rmo.opt.i [2019-12-18 13:44:37,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165c83be5/de11f73bacea43a09fd4162a3a409c61/FLAG7aeb22cdf [2019-12-18 13:44:38,274 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:44:38,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_rmo.opt.i [2019-12-18 13:44:38,288 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165c83be5/de11f73bacea43a09fd4162a3a409c61/FLAG7aeb22cdf [2019-12-18 13:44:38,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165c83be5/de11f73bacea43a09fd4162a3a409c61 [2019-12-18 13:44:38,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:44:38,498 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:44:38,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:44:38,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:44:38,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:44:38,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:44:38" (1/1) ... [2019-12-18 13:44:38,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd22070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:38, skipping insertion in model container [2019-12-18 13:44:38,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:44:38" (1/1) ... [2019-12-18 13:44:38,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:44:38,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:44:39,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:44:39,153 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:44:39,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:44:39,307 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:44:39,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39 WrapperNode [2019-12-18 13:44:39,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:44:39,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:44:39,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:44:39,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:44:39,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39" (1/1) ... [2019-12-18 13:44:39,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39" (1/1) ... [2019-12-18 13:44:39,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:44:39,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:44:39,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:44:39,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:44:39,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39" (1/1) ... [2019-12-18 13:44:39,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39" (1/1) ... [2019-12-18 13:44:39,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39" (1/1) ... [2019-12-18 13:44:39,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39" (1/1) ... [2019-12-18 13:44:39,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39" (1/1) ... [2019-12-18 13:44:39,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39" (1/1) ... [2019-12-18 13:44:39,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39" (1/1) ... [2019-12-18 13:44:39,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:44:39,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:44:39,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:44:39,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:44:39,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39" (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 13:44:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:44:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:44:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:44:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:44:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:44:39,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:44:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:44:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:44:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:44:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:44:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:44:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:44:39,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:44:39,499 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 13:44:40,277 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:44:40,278 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:44:40,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:44:40 BoogieIcfgContainer [2019-12-18 13:44:40,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:44:40,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:44:40,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:44:40,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:44:40,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:44:38" (1/3) ... [2019-12-18 13:44:40,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330df5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:44:40, skipping insertion in model container [2019-12-18 13:44:40,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:44:39" (2/3) ... [2019-12-18 13:44:40,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330df5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:44:40, skipping insertion in model container [2019-12-18 13:44:40,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:44:40" (3/3) ... [2019-12-18 13:44:40,292 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_rmo.opt.i [2019-12-18 13:44:40,304 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:44:40,304 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:44:40,316 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:44:40,317 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:44:40,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,399 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,400 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,416 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,417 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,447 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,449 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,457 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,457 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,457 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,460 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,460 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:44:40,477 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:44:40,497 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:44:40,497 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:44:40,497 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:44:40,498 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:44:40,498 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:44:40,498 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:44:40,498 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:44:40,498 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:44:40,514 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 13:44:40,516 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 13:44:40,613 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 13:44:40,613 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:44:40,633 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:44:40,663 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 13:44:40,710 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 13:44:40,710 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:44:40,719 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:44:40,741 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:44:40,742 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:44:46,159 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 13:44:46,287 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 13:44:46,662 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-18 13:44:46,662 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 13:44:46,666 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 13:45:10,921 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 13:45:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 13:45:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:45:10,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:10,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:45:10,929 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 13:45:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-18 13:45:10,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:10,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620564495] [2019-12-18 13:45:10,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:11,188 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 13:45:11,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620564495] [2019-12-18 13:45:11,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:11,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:45:11,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401036465] [2019-12-18 13:45:11,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:45:11,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:11,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:45:11,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:45:11,218 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 13:45:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:14,330 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-18 13:45:14,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:45:14,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:45:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:15,121 INFO L225 Difference]: With dead ends: 125570 [2019-12-18 13:45:15,122 INFO L226 Difference]: Without dead ends: 111010 [2019-12-18 13:45:15,124 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 13:45:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-18 13:45:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-18 13:45:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-18 13:45:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-18 13:45:28,209 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-18 13:45:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:28,210 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-18 13:45:28,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:45:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-18 13:45:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:45:28,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:28,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:28,216 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 13:45:28,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-18 13:45:28,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:28,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183618268] [2019-12-18 13:45:28,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:28,349 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 13:45:28,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183618268] [2019-12-18 13:45:28,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:28,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:45:28,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171944429] [2019-12-18 13:45:28,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:45:28,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:28,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:45:28,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:45:28,353 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-18 13:45:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:33,788 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-18 13:45:33,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:45:33,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:45:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:34,476 INFO L225 Difference]: With dead ends: 172646 [2019-12-18 13:45:34,476 INFO L226 Difference]: Without dead ends: 172548 [2019-12-18 13:45:34,477 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 13:45:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-18 13:45:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-18 13:45:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-18 13:45:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-18 13:45:44,043 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-18 13:45:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:44,044 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-18 13:45:44,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:45:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-18 13:45:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:45:44,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:44,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:44,051 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 13:45:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:44,051 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-18 13:45:44,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:44,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282772607] [2019-12-18 13:45:44,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:45:44,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282772607] [2019-12-18 13:45:44,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:44,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:45:44,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234635204] [2019-12-18 13:45:44,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:45:44,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:44,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:45:44,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:45:44,129 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-18 13:45:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:44,267 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-18 13:45:44,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:45:44,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:45:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:49,250 INFO L225 Difference]: With dead ends: 34208 [2019-12-18 13:45:49,250 INFO L226 Difference]: Without dead ends: 34208 [2019-12-18 13:45:49,250 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 13:45:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-18 13:45:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-18 13:45:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-18 13:45:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-18 13:45:49,859 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-18 13:45:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:49,859 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-18 13:45:49,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:45:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-18 13:45:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:45:49,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:49,863 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:49,863 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 13:45:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-18 13:45:49,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:49,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706689030] [2019-12-18 13:45:49,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:49,937 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 13:45:49,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706689030] [2019-12-18 13:45:49,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:49,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:45:49,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320683736] [2019-12-18 13:45:49,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:45:49,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:45:49,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:45:49,939 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-18 13:45:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:50,199 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-18 13:45:50,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:45:50,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 13:45:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:50,295 INFO L225 Difference]: With dead ends: 51809 [2019-12-18 13:45:50,295 INFO L226 Difference]: Without dead ends: 51809 [2019-12-18 13:45:50,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:45:50,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-18 13:45:51,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-18 13:45:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-18 13:45:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-18 13:45:51,402 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-18 13:45:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:51,404 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-18 13:45:51,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:45:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-18 13:45:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:45:51,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:51,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:45:51,407 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 13:45:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:51,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-18 13:45:51,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:51,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686662442] [2019-12-18 13:45:51,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:45:51,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686662442] [2019-12-18 13:45:51,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:51,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:45:51,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889393202] [2019-12-18 13:45:51,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:45:51,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:51,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:45:51,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:45:51,496 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-18 13:45:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:52,082 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-18 13:45:52,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:45:52,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:45:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:52,179 INFO L225 Difference]: With dead ends: 53507 [2019-12-18 13:45:52,180 INFO L226 Difference]: Without dead ends: 53507 [2019-12-18 13:45:52,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:45:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-18 13:45:52,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-18 13:45:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-18 13:45:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-18 13:45:53,047 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-18 13:45:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:53,047 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-18 13:45:53,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:45:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-18 13:45:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:45:53,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:53,061 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] [2019-12-18 13:45:53,062 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 13:45:53,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:53,062 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-18 13:45:53,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:53,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997830536] [2019-12-18 13:45:53,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:53,216 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 13:45:53,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997830536] [2019-12-18 13:45:53,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:53,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:45:53,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844657418] [2019-12-18 13:45:53,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:45:53,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:53,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:45:53,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:45:53,218 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-18 13:45:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:54,534 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-18 13:45:54,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:45:54,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 13:45:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:54,709 INFO L225 Difference]: With dead ends: 66834 [2019-12-18 13:45:54,710 INFO L226 Difference]: Without dead ends: 66820 [2019-12-18 13:45:54,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:45:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-18 13:45:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-18 13:45:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-18 13:45:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-18 13:45:55,616 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-18 13:45:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:55,617 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-18 13:45:55,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:45:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-18 13:45:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:45:55,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:55,634 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 13:45:55,634 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 13:45:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-18 13:45:55,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:55,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554425570] [2019-12-18 13:45:55,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:55,686 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 13:45:55,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554425570] [2019-12-18 13:45:55,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:55,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:45:55,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508021106] [2019-12-18 13:45:55,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:45:55,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:55,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:45:55,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:45:55,688 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-18 13:45:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:55,766 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-18 13:45:55,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:45:55,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:45:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:55,792 INFO L225 Difference]: With dead ends: 18127 [2019-12-18 13:45:55,792 INFO L226 Difference]: Without dead ends: 18127 [2019-12-18 13:45:55,793 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 13:45:55,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-18 13:45:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-18 13:45:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-18 13:45:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-18 13:45:56,325 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-18 13:45:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:56,325 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-18 13:45:56,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:45:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-18 13:45:56,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:45:56,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:56,339 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] [2019-12-18 13:45:56,339 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 13:45:56,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:56,339 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-18 13:45:56,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:56,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34345212] [2019-12-18 13:45:56,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:56,453 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 13:45:56,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34345212] [2019-12-18 13:45:56,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:56,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:45:56,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634542990] [2019-12-18 13:45:56,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:45:56,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:56,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:45:56,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:45:56,455 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-18 13:45:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:57,139 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-18 13:45:57,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:45:57,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:45:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:57,190 INFO L225 Difference]: With dead ends: 25206 [2019-12-18 13:45:57,190 INFO L226 Difference]: Without dead ends: 25206 [2019-12-18 13:45:57,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:45:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-18 13:45:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-18 13:45:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-18 13:45:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-18 13:45:57,714 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-18 13:45:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:57,714 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-18 13:45:57,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:45:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-18 13:45:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:45:57,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:57,744 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] [2019-12-18 13:45:57,745 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 13:45:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-18 13:45:57,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:57,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619648358] [2019-12-18 13:45:57,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:57,899 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 13:45:57,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619648358] [2019-12-18 13:45:57,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:57,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:45:57,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289633167] [2019-12-18 13:45:57,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:45:57,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:45:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:45:57,901 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-18 13:45:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:59,268 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-18 13:45:59,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:45:59,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:45:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:59,314 INFO L225 Difference]: With dead ends: 28185 [2019-12-18 13:45:59,314 INFO L226 Difference]: Without dead ends: 28185 [2019-12-18 13:45:59,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:45:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-18 13:45:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-18 13:45:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-18 13:45:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-18 13:45:59,662 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-18 13:45:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:45:59,662 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-18 13:45:59,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:45:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-18 13:45:59,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:45:59,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:45:59,693 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] [2019-12-18 13:45:59,693 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 13:45:59,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:45:59,693 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-18 13:45:59,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:45:59,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708752146] [2019-12-18 13:45:59,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:45:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:45:59,758 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 13:45:59,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708752146] [2019-12-18 13:45:59,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:45:59,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:45:59,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877254746] [2019-12-18 13:45:59,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:45:59,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:45:59,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:45:59,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:45:59,760 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-18 13:45:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:45:59,849 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-18 13:45:59,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:45:59,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 13:45:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:45:59,881 INFO L225 Difference]: With dead ends: 18279 [2019-12-18 13:45:59,881 INFO L226 Difference]: Without dead ends: 18279 [2019-12-18 13:45:59,882 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 13:45:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-18 13:46:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-18 13:46:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-18 13:46:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-18 13:46:00,276 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-18 13:46:00,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:00,276 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-18 13:46:00,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:46:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-18 13:46:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:46:00,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:00,300 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] [2019-12-18 13:46:00,300 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 13:46:00,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:00,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-18 13:46:00,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:00,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011897962] [2019-12-18 13:46:00,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:00,426 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 13:46:00,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011897962] [2019-12-18 13:46:00,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:00,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:46:00,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315427858] [2019-12-18 13:46:00,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:46:00,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:00,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:46:00,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:46:00,431 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-18 13:46:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:00,983 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-18 13:46:00,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:46:00,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:46:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:01,067 INFO L225 Difference]: With dead ends: 48537 [2019-12-18 13:46:01,068 INFO L226 Difference]: Without dead ends: 38006 [2019-12-18 13:46:01,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:46:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-18 13:46:01,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-18 13:46:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-18 13:46:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-18 13:46:01,562 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-18 13:46:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:01,563 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-18 13:46:01,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:46:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-18 13:46:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:46:01,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:01,587 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] [2019-12-18 13:46:01,588 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 13:46:01,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:01,588 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-18 13:46:01,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:01,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861115288] [2019-12-18 13:46:01,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:01,681 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 13:46:01,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861115288] [2019-12-18 13:46:01,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:01,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:46:01,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528544097] [2019-12-18 13:46:01,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:46:01,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:01,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:46:01,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:46:01,684 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-18 13:46:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:02,185 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-18 13:46:02,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:46:02,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:46:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:02,247 INFO L225 Difference]: With dead ends: 57554 [2019-12-18 13:46:02,247 INFO L226 Difference]: Without dead ends: 41745 [2019-12-18 13:46:02,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:46:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-18 13:46:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-18 13:46:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-18 13:46:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-18 13:46:03,041 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-18 13:46:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:03,041 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-18 13:46:03,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:46:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-18 13:46:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:46:03,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:03,073 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] [2019-12-18 13:46:03,073 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 13:46:03,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:03,074 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-18 13:46:03,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:03,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852443084] [2019-12-18 13:46:03,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:03,161 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 13:46:03,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852443084] [2019-12-18 13:46:03,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:03,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:46:03,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457647165] [2019-12-18 13:46:03,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:46:03,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:03,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:46:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:46:03,165 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-18 13:46:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:03,598 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-18 13:46:03,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:46:03,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:46:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:03,666 INFO L225 Difference]: With dead ends: 51247 [2019-12-18 13:46:03,666 INFO L226 Difference]: Without dead ends: 47407 [2019-12-18 13:46:03,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:46:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-18 13:46:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-18 13:46:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-18 13:46:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-18 13:46:04,237 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-18 13:46:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:04,238 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-18 13:46:04,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:46:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-18 13:46:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:46:04,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:04,284 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] [2019-12-18 13:46:04,284 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 13:46:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:04,285 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-18 13:46:04,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:04,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597976219] [2019-12-18 13:46:04,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:04,367 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 13:46:04,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597976219] [2019-12-18 13:46:04,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:04,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:46:04,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966467958] [2019-12-18 13:46:04,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:46:04,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:04,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:46:04,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:46:04,370 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-18 13:46:04,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:04,466 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-18 13:46:04,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:46:04,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:46:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:04,502 INFO L225 Difference]: With dead ends: 20919 [2019-12-18 13:46:04,502 INFO L226 Difference]: Without dead ends: 20919 [2019-12-18 13:46:04,503 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 13:46:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-18 13:46:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-18 13:46:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-18 13:46:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-18 13:46:04,816 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-18 13:46:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:04,816 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-18 13:46:04,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:46:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-18 13:46:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:46:04,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:04,837 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 13:46:04,837 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 13:46:04,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:04,837 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-18 13:46:04,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:04,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671954047] [2019-12-18 13:46:04,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:04,899 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 13:46:04,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671954047] [2019-12-18 13:46:04,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:04,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:46:04,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151966321] [2019-12-18 13:46:04,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:46:04,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:04,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:46:04,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:46:04,901 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-18 13:46:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:05,030 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-18 13:46:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:46:05,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:46:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:05,065 INFO L225 Difference]: With dead ends: 24197 [2019-12-18 13:46:05,066 INFO L226 Difference]: Without dead ends: 24197 [2019-12-18 13:46:05,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 13:46:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-18 13:46:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-18 13:46:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-18 13:46:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-18 13:46:05,569 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-18 13:46:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:05,569 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-18 13:46:05,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:46:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-18 13:46:05,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:05,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:05,594 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 13:46:05,594 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 13:46:05,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:05,594 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-18 13:46:05,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:05,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165108404] [2019-12-18 13:46:05,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:05,661 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 13:46:05,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165108404] [2019-12-18 13:46:05,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:05,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:46:05,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128059039] [2019-12-18 13:46:05,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:46:05,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:05,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:46:05,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:46:05,663 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-18 13:46:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:05,803 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-18 13:46:05,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:46:05,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 13:46:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:05,839 INFO L225 Difference]: With dead ends: 24621 [2019-12-18 13:46:05,839 INFO L226 Difference]: Without dead ends: 24621 [2019-12-18 13:46:05,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 13:46:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-18 13:46:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-18 13:46:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-18 13:46:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-18 13:46:06,193 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-18 13:46:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:06,193 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-18 13:46:06,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:46:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-18 13:46:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:46:06,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:06,216 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 13:46:06,217 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 13:46:06,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:06,217 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-18 13:46:06,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:06,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975584293] [2019-12-18 13:46:06,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:06,288 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 13:46:06,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975584293] [2019-12-18 13:46:06,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:06,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:46:06,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977903480] [2019-12-18 13:46:06,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:46:06,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:06,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:46:06,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:46:06,291 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 3 states. [2019-12-18 13:46:06,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:06,366 INFO L93 Difference]: Finished difference Result 21144 states and 65299 transitions. [2019-12-18 13:46:06,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:46:06,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:46:06,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:06,397 INFO L225 Difference]: With dead ends: 21144 [2019-12-18 13:46:06,397 INFO L226 Difference]: Without dead ends: 21144 [2019-12-18 13:46:06,398 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 13:46:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21144 states. [2019-12-18 13:46:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21144 to 18261. [2019-12-18 13:46:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18261 states. [2019-12-18 13:46:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18261 states to 18261 states and 57078 transitions. [2019-12-18 13:46:06,709 INFO L78 Accepts]: Start accepts. Automaton has 18261 states and 57078 transitions. Word has length 66 [2019-12-18 13:46:06,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:06,709 INFO L462 AbstractCegarLoop]: Abstraction has 18261 states and 57078 transitions. [2019-12-18 13:46:06,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:46:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 18261 states and 57078 transitions. [2019-12-18 13:46:06,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:06,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:06,731 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 13:46:06,731 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 13:46:06,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 384042528, now seen corresponding path program 1 times [2019-12-18 13:46:06,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:06,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478879130] [2019-12-18 13:46:06,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:06,949 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 13:46:06,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478879130] [2019-12-18 13:46:06,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:06,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:46:06,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723923044] [2019-12-18 13:46:06,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:46:06,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:06,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:46:06,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:46:06,951 INFO L87 Difference]: Start difference. First operand 18261 states and 57078 transitions. Second operand 10 states. [2019-12-18 13:46:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:09,164 INFO L93 Difference]: Finished difference Result 32721 states and 102046 transitions. [2019-12-18 13:46:09,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:46:09,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:46:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:09,209 INFO L225 Difference]: With dead ends: 32721 [2019-12-18 13:46:09,209 INFO L226 Difference]: Without dead ends: 26594 [2019-12-18 13:46:09,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-18 13:46:09,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26594 states. [2019-12-18 13:46:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26594 to 18862. [2019-12-18 13:46:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18862 states. [2019-12-18 13:46:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18862 states to 18862 states and 58839 transitions. [2019-12-18 13:46:09,733 INFO L78 Accepts]: Start accepts. Automaton has 18862 states and 58839 transitions. Word has length 67 [2019-12-18 13:46:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:09,733 INFO L462 AbstractCegarLoop]: Abstraction has 18862 states and 58839 transitions. [2019-12-18 13:46:09,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:46:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 18862 states and 58839 transitions. [2019-12-18 13:46:09,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:09,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:09,757 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 13:46:09,757 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 13:46:09,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:09,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1908292690, now seen corresponding path program 2 times [2019-12-18 13:46:09,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:09,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725092300] [2019-12-18 13:46:09,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:09,955 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 13:46:09,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725092300] [2019-12-18 13:46:09,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:09,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:46:09,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530925789] [2019-12-18 13:46:09,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:46:09,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:09,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:46:09,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:46:09,957 INFO L87 Difference]: Start difference. First operand 18862 states and 58839 transitions. Second operand 10 states. [2019-12-18 13:46:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:11,752 INFO L93 Difference]: Finished difference Result 32409 states and 100417 transitions. [2019-12-18 13:46:11,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:46:11,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:46:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:11,792 INFO L225 Difference]: With dead ends: 32409 [2019-12-18 13:46:11,792 INFO L226 Difference]: Without dead ends: 27846 [2019-12-18 13:46:11,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:46:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27846 states. [2019-12-18 13:46:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27846 to 19314. [2019-12-18 13:46:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19314 states. [2019-12-18 13:46:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19314 states to 19314 states and 60087 transitions. [2019-12-18 13:46:12,145 INFO L78 Accepts]: Start accepts. Automaton has 19314 states and 60087 transitions. Word has length 67 [2019-12-18 13:46:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:12,146 INFO L462 AbstractCegarLoop]: Abstraction has 19314 states and 60087 transitions. [2019-12-18 13:46:12,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:46:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 19314 states and 60087 transitions. [2019-12-18 13:46:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:12,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:12,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:46:12,166 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:12,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:12,167 INFO L82 PathProgramCache]: Analyzing trace with hash 993635084, now seen corresponding path program 3 times [2019-12-18 13:46:12,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:12,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363436500] [2019-12-18 13:46:12,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:12,344 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 13:46:12,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363436500] [2019-12-18 13:46:12,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:12,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:46:12,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460348268] [2019-12-18 13:46:12,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:46:12,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:46:12,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:46:12,348 INFO L87 Difference]: Start difference. First operand 19314 states and 60087 transitions. Second operand 10 states. [2019-12-18 13:46:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:14,207 INFO L93 Difference]: Finished difference Result 30553 states and 94665 transitions. [2019-12-18 13:46:14,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:46:14,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:46:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:14,248 INFO L225 Difference]: With dead ends: 30553 [2019-12-18 13:46:14,248 INFO L226 Difference]: Without dead ends: 27070 [2019-12-18 13:46:14,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:46:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27070 states. [2019-12-18 13:46:14,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27070 to 18882. [2019-12-18 13:46:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18882 states. [2019-12-18 13:46:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18882 states to 18882 states and 58755 transitions. [2019-12-18 13:46:14,590 INFO L78 Accepts]: Start accepts. Automaton has 18882 states and 58755 transitions. Word has length 67 [2019-12-18 13:46:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:14,590 INFO L462 AbstractCegarLoop]: Abstraction has 18882 states and 58755 transitions. [2019-12-18 13:46:14,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:46:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 18882 states and 58755 transitions. [2019-12-18 13:46:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:14,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:14,610 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 13:46:14,610 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash 397917466, now seen corresponding path program 4 times [2019-12-18 13:46:14,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:14,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466514098] [2019-12-18 13:46:14,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:16,330 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 13:46:16,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466514098] [2019-12-18 13:46:16,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:16,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 13:46:16,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711103050] [2019-12-18 13:46:16,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 13:46:16,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:16,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 13:46:16,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-12-18 13:46:16,332 INFO L87 Difference]: Start difference. First operand 18882 states and 58755 transitions. Second operand 24 states. [2019-12-18 13:46:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:26,989 INFO L93 Difference]: Finished difference Result 30669 states and 93829 transitions. [2019-12-18 13:46:26,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-18 13:46:26,989 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-18 13:46:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:27,029 INFO L225 Difference]: With dead ends: 30669 [2019-12-18 13:46:27,029 INFO L226 Difference]: Without dead ends: 28323 [2019-12-18 13:46:27,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=633, Invalid=3923, Unknown=0, NotChecked=0, Total=4556 [2019-12-18 13:46:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28323 states. [2019-12-18 13:46:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28323 to 21579. [2019-12-18 13:46:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21579 states. [2019-12-18 13:46:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21579 states to 21579 states and 66940 transitions. [2019-12-18 13:46:27,415 INFO L78 Accepts]: Start accepts. Automaton has 21579 states and 66940 transitions. Word has length 67 [2019-12-18 13:46:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:27,416 INFO L462 AbstractCegarLoop]: Abstraction has 21579 states and 66940 transitions. [2019-12-18 13:46:27,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 13:46:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 21579 states and 66940 transitions. [2019-12-18 13:46:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:27,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:27,446 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 13:46:27,446 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:27,447 INFO L82 PathProgramCache]: Analyzing trace with hash 68355254, now seen corresponding path program 5 times [2019-12-18 13:46:27,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:27,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561925639] [2019-12-18 13:46:27,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:28,595 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 13:46:28,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561925639] [2019-12-18 13:46:28,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:28,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 13:46:28,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455311911] [2019-12-18 13:46:28,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 13:46:28,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:28,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 13:46:28,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:46:28,597 INFO L87 Difference]: Start difference. First operand 21579 states and 66940 transitions. Second operand 23 states. [2019-12-18 13:46:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:37,307 INFO L93 Difference]: Finished difference Result 29484 states and 90486 transitions. [2019-12-18 13:46:37,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 13:46:37,307 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-18 13:46:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:37,348 INFO L225 Difference]: With dead ends: 29484 [2019-12-18 13:46:37,348 INFO L226 Difference]: Without dead ends: 28681 [2019-12-18 13:46:37,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=421, Invalid=2441, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 13:46:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28681 states. [2019-12-18 13:46:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28681 to 21531. [2019-12-18 13:46:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21531 states. [2019-12-18 13:46:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21531 states to 21531 states and 66812 transitions. [2019-12-18 13:46:37,715 INFO L78 Accepts]: Start accepts. Automaton has 21531 states and 66812 transitions. Word has length 67 [2019-12-18 13:46:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:37,715 INFO L462 AbstractCegarLoop]: Abstraction has 21531 states and 66812 transitions. [2019-12-18 13:46:37,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 13:46:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 21531 states and 66812 transitions. [2019-12-18 13:46:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:37,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:37,736 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 13:46:37,736 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:37,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1803113718, now seen corresponding path program 6 times [2019-12-18 13:46:37,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:37,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456612012] [2019-12-18 13:46:37,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:37,956 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 13:46:37,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456612012] [2019-12-18 13:46:37,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:37,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:46:37,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920311321] [2019-12-18 13:46:37,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:46:37,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:37,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:46:37,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:46:37,958 INFO L87 Difference]: Start difference. First operand 21531 states and 66812 transitions. Second operand 12 states. [2019-12-18 13:46:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:40,120 INFO L93 Difference]: Finished difference Result 33360 states and 102944 transitions. [2019-12-18 13:46:40,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:46:40,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 13:46:40,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:40,189 INFO L225 Difference]: With dead ends: 33360 [2019-12-18 13:46:40,189 INFO L226 Difference]: Without dead ends: 30091 [2019-12-18 13:46:40,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:46:40,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30091 states. [2019-12-18 13:46:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30091 to 21639. [2019-12-18 13:46:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21639 states. [2019-12-18 13:46:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21639 states to 21639 states and 67099 transitions. [2019-12-18 13:46:40,668 INFO L78 Accepts]: Start accepts. Automaton has 21639 states and 67099 transitions. Word has length 67 [2019-12-18 13:46:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:40,668 INFO L462 AbstractCegarLoop]: Abstraction has 21639 states and 67099 transitions. [2019-12-18 13:46:40,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:46:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 21639 states and 67099 transitions. [2019-12-18 13:46:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:40,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:40,689 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 13:46:40,689 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:40,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1857250972, now seen corresponding path program 7 times [2019-12-18 13:46:40,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:40,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966160227] [2019-12-18 13:46:40,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:46:42,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966160227] [2019-12-18 13:46:42,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:42,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 13:46:42,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210195239] [2019-12-18 13:46:42,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 13:46:42,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 13:46:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:46:42,188 INFO L87 Difference]: Start difference. First operand 21639 states and 67099 transitions. Second operand 23 states. [2019-12-18 13:46:52,966 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-12-18 13:46:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:46:57,086 INFO L93 Difference]: Finished difference Result 38665 states and 116663 transitions. [2019-12-18 13:46:57,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-12-18 13:46:57,087 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-18 13:46:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:46:57,133 INFO L225 Difference]: With dead ends: 38665 [2019-12-18 13:46:57,133 INFO L226 Difference]: Without dead ends: 34181 [2019-12-18 13:46:57,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3433 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1461, Invalid=9669, Unknown=0, NotChecked=0, Total=11130 [2019-12-18 13:46:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34181 states. [2019-12-18 13:46:57,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34181 to 22943. [2019-12-18 13:46:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22943 states. [2019-12-18 13:46:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22943 states to 22943 states and 70649 transitions. [2019-12-18 13:46:57,560 INFO L78 Accepts]: Start accepts. Automaton has 22943 states and 70649 transitions. Word has length 67 [2019-12-18 13:46:57,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:46:57,560 INFO L462 AbstractCegarLoop]: Abstraction has 22943 states and 70649 transitions. [2019-12-18 13:46:57,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 13:46:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 22943 states and 70649 transitions. [2019-12-18 13:46:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:46:57,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:46:57,586 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 13:46:57,586 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:46:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:46:57,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1998569144, now seen corresponding path program 8 times [2019-12-18 13:46:57,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:46:57,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059539499] [2019-12-18 13:46:57,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:46:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:46:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:46:57,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059539499] [2019-12-18 13:46:57,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:46:57,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:46:57,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348419009] [2019-12-18 13:46:57,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:46:57,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:46:57,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:46:57,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:46:57,847 INFO L87 Difference]: Start difference. First operand 22943 states and 70649 transitions. Second operand 13 states. [2019-12-18 13:47:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:01,087 INFO L93 Difference]: Finished difference Result 38751 states and 117820 transitions. [2019-12-18 13:47:01,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 13:47:01,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-18 13:47:01,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:01,138 INFO L225 Difference]: With dead ends: 38751 [2019-12-18 13:47:01,139 INFO L226 Difference]: Without dead ends: 33473 [2019-12-18 13:47:01,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2019-12-18 13:47:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33473 states. [2019-12-18 13:47:01,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33473 to 22078. [2019-12-18 13:47:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22078 states. [2019-12-18 13:47:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22078 states to 22078 states and 67977 transitions. [2019-12-18 13:47:01,721 INFO L78 Accepts]: Start accepts. Automaton has 22078 states and 67977 transitions. Word has length 67 [2019-12-18 13:47:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:01,721 INFO L462 AbstractCegarLoop]: Abstraction has 22078 states and 67977 transitions. [2019-12-18 13:47:01,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:47:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 22078 states and 67977 transitions. [2019-12-18 13:47:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:01,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:01,746 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 13:47:01,746 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 9 times [2019-12-18 13:47:01,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:01,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749160537] [2019-12-18 13:47:01,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:47:02,756 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 13:47:02,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749160537] [2019-12-18 13:47:02,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:47:02,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 13:47:02,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633996783] [2019-12-18 13:47:02,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 13:47:02,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:47:02,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 13:47:02,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:47:02,758 INFO L87 Difference]: Start difference. First operand 22078 states and 67977 transitions. Second operand 21 states. [2019-12-18 13:47:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:11,119 INFO L93 Difference]: Finished difference Result 36287 states and 109425 transitions. [2019-12-18 13:47:11,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 13:47:11,119 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-18 13:47:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:11,170 INFO L225 Difference]: With dead ends: 36287 [2019-12-18 13:47:11,170 INFO L226 Difference]: Without dead ends: 35360 [2019-12-18 13:47:11,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=358, Invalid=1712, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 13:47:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35360 states. [2019-12-18 13:47:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35360 to 22074. [2019-12-18 13:47:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22074 states. [2019-12-18 13:47:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22074 states to 22074 states and 67966 transitions. [2019-12-18 13:47:11,776 INFO L78 Accepts]: Start accepts. Automaton has 22074 states and 67966 transitions. Word has length 67 [2019-12-18 13:47:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:11,776 INFO L462 AbstractCegarLoop]: Abstraction has 22074 states and 67966 transitions. [2019-12-18 13:47:11,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 13:47:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 22074 states and 67966 transitions. [2019-12-18 13:47:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:11,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:11,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, 1] [2019-12-18 13:47:11,798 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:11,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1325995694, now seen corresponding path program 10 times [2019-12-18 13:47:11,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:11,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245120544] [2019-12-18 13:47:11,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:47:12,005 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 13:47:12,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245120544] [2019-12-18 13:47:12,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:47:12,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:47:12,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818665680] [2019-12-18 13:47:12,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:47:12,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:47:12,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:47:12,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:47:12,007 INFO L87 Difference]: Start difference. First operand 22074 states and 67966 transitions. Second operand 12 states. [2019-12-18 13:47:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:14,438 INFO L93 Difference]: Finished difference Result 34845 states and 106182 transitions. [2019-12-18 13:47:14,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 13:47:14,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 13:47:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:14,487 INFO L225 Difference]: With dead ends: 34845 [2019-12-18 13:47:14,487 INFO L226 Difference]: Without dead ends: 32515 [2019-12-18 13:47:14,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2019-12-18 13:47:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32515 states. [2019-12-18 13:47:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32515 to 21593. [2019-12-18 13:47:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21593 states. [2019-12-18 13:47:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21593 states to 21593 states and 66686 transitions. [2019-12-18 13:47:14,891 INFO L78 Accepts]: Start accepts. Automaton has 21593 states and 66686 transitions. Word has length 67 [2019-12-18 13:47:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:14,891 INFO L462 AbstractCegarLoop]: Abstraction has 21593 states and 66686 transitions. [2019-12-18 13:47:14,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:47:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21593 states and 66686 transitions. [2019-12-18 13:47:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:14,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:14,912 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 13:47:14,912 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:14,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:14,912 INFO L82 PathProgramCache]: Analyzing trace with hash -715209700, now seen corresponding path program 11 times [2019-12-18 13:47:14,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:14,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422089019] [2019-12-18 13:47:14,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:47:15,626 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 13:47:15,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422089019] [2019-12-18 13:47:15,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:47:15,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 13:47:15,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755992926] [2019-12-18 13:47:15,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 13:47:15,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:47:15,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 13:47:15,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-12-18 13:47:15,629 INFO L87 Difference]: Start difference. First operand 21593 states and 66686 transitions. Second operand 22 states. [2019-12-18 13:47:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:25,397 INFO L93 Difference]: Finished difference Result 32480 states and 99780 transitions. [2019-12-18 13:47:25,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 13:47:25,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-18 13:47:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:25,444 INFO L225 Difference]: With dead ends: 32480 [2019-12-18 13:47:25,444 INFO L226 Difference]: Without dead ends: 31881 [2019-12-18 13:47:25,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=457, Invalid=2735, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 13:47:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31881 states. [2019-12-18 13:47:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31881 to 22581. [2019-12-18 13:47:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22581 states. [2019-12-18 13:47:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22581 states to 22581 states and 69528 transitions. [2019-12-18 13:47:25,857 INFO L78 Accepts]: Start accepts. Automaton has 22581 states and 69528 transitions. Word has length 67 [2019-12-18 13:47:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:25,858 INFO L462 AbstractCegarLoop]: Abstraction has 22581 states and 69528 transitions. [2019-12-18 13:47:25,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 13:47:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 22581 states and 69528 transitions. [2019-12-18 13:47:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:25,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:25,881 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 13:47:25,882 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash -531990854, now seen corresponding path program 12 times [2019-12-18 13:47:25,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:25,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861237203] [2019-12-18 13:47:25,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:47:26,147 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 13:47:26,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861237203] [2019-12-18 13:47:26,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:47:26,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:47:26,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172369893] [2019-12-18 13:47:26,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 13:47:26,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:47:26,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 13:47:26,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:47:26,149 INFO L87 Difference]: Start difference. First operand 22581 states and 69528 transitions. Second operand 14 states. [2019-12-18 13:47:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:47:29,811 INFO L93 Difference]: Finished difference Result 35798 states and 109134 transitions. [2019-12-18 13:47:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 13:47:29,812 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 13:47:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:47:29,858 INFO L225 Difference]: With dead ends: 35798 [2019-12-18 13:47:29,858 INFO L226 Difference]: Without dead ends: 33340 [2019-12-18 13:47:29,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 13:47:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33340 states. [2019-12-18 13:47:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33340 to 21858. [2019-12-18 13:47:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21858 states. [2019-12-18 13:47:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21858 states to 21858 states and 67480 transitions. [2019-12-18 13:47:30,265 INFO L78 Accepts]: Start accepts. Automaton has 21858 states and 67480 transitions. Word has length 67 [2019-12-18 13:47:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:47:30,265 INFO L462 AbstractCegarLoop]: Abstraction has 21858 states and 67480 transitions. [2019-12-18 13:47:30,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 13:47:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 21858 states and 67480 transitions. [2019-12-18 13:47:30,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:47:30,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:47:30,290 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 13:47:30,290 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:47:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:47:30,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 13 times [2019-12-18 13:47:30,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:47:30,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502954971] [2019-12-18 13:47:30,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:47:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:47:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:47:30,444 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:47:30,444 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:47:30,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1312~0.base_23| 4)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1312~0.base_23|) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1312~0.base_23| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1312~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1312~0.base_23|) |v_ULTIMATE.start_main_~#t1312~0.offset_17| 0)) |v_#memory_int_17|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1312~0.base_23|) 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= |v_ULTIMATE.start_main_~#t1312~0.offset_17| 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1314~0.offset=|v_ULTIMATE.start_main_~#t1314~0.offset_14|, ULTIMATE.start_main_~#t1314~0.base=|v_ULTIMATE.start_main_~#t1314~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ULTIMATE.start_main_~#t1312~0.base=|v_ULTIMATE.start_main_~#t1312~0.base_23|, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ULTIMATE.start_main_~#t1313~0.base=|v_ULTIMATE.start_main_~#t1313~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1313~0.offset=|v_ULTIMATE.start_main_~#t1313~0.offset_12|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ULTIMATE.start_main_~#t1312~0.offset=|v_ULTIMATE.start_main_~#t1312~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1314~0.offset, ULTIMATE.start_main_~#t1314~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1312~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1313~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1313~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1312~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:47:30,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1313~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1313~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1313~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1313~0.base_11|) |v_ULTIMATE.start_main_~#t1313~0.offset_9| 1))) (= 0 |v_ULTIMATE.start_main_~#t1313~0.offset_9|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1313~0.base_11| 1)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1313~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1313~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1313~0.offset=|v_ULTIMATE.start_main_~#t1313~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1313~0.base=|v_ULTIMATE.start_main_~#t1313~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1313~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1313~0.base] because there is no mapped edge [2019-12-18 13:47:30,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:47:30,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In704027632 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In704027632 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out704027632| ~z~0_In704027632) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out704027632| ~z$w_buff1~0_In704027632) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In704027632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In704027632, ~z$w_buff1~0=~z$w_buff1~0_In704027632, ~z~0=~z~0_In704027632} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out704027632|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In704027632, ~z$w_buff1_used~0=~z$w_buff1_used~0_In704027632, ~z$w_buff1~0=~z$w_buff1~0_In704027632, ~z~0=~z~0_In704027632} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 13:47:30,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 13:47:30,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1314~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1314~0.base_13|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1314~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1314~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1314~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1314~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1314~0.base_13|) |v_ULTIMATE.start_main_~#t1314~0.offset_11| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1314~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1314~0.offset=|v_ULTIMATE.start_main_~#t1314~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1314~0.base=|v_ULTIMATE.start_main_~#t1314~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1314~0.offset, ULTIMATE.start_main_~#t1314~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 13:47:30,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1301095949 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1301095949 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1301095949|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out1301095949| ~z$w_buff0_used~0_In1301095949)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1301095949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1301095949} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1301095949, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1301095949|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1301095949} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:47:30,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1699827279 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1699827279 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1699827279 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1699827279 256) 0))) (or (and (= ~z$w_buff1_used~0_In1699827279 |P1Thread1of1ForFork2_#t~ite12_Out1699827279|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1699827279|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1699827279, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1699827279, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1699827279, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1699827279} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1699827279, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1699827279, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1699827279, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1699827279|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1699827279} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:47:30,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In618574438 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In618574438 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out618574438| 0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In618574438 |P1Thread1of1ForFork2_#t~ite13_Out618574438|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In618574438, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In618574438} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In618574438, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out618574438|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In618574438} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:47:30,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-59984649 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In-59984649| |P2Thread1of1ForFork0_#t~ite26_Out-59984649|) (not .cse0) (= ~z$w_buff0_used~0_In-59984649 |P2Thread1of1ForFork0_#t~ite27_Out-59984649|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-59984649| |P2Thread1of1ForFork0_#t~ite26_Out-59984649|) (= ~z$w_buff0_used~0_In-59984649 |P2Thread1of1ForFork0_#t~ite26_Out-59984649|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-59984649 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-59984649 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-59984649 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-59984649 256) 0)))) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-59984649|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-59984649, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-59984649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-59984649, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-59984649, ~weak$$choice2~0=~weak$$choice2~0_In-59984649} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-59984649|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-59984649|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-59984649, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-59984649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-59984649, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-59984649, ~weak$$choice2~0=~weak$$choice2~0_In-59984649} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 13:47:30,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:47:30,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-525963930 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-525963930 256)))) (or (and (= ~z$w_buff0_used~0_In-525963930 |P0Thread1of1ForFork1_#t~ite5_Out-525963930|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-525963930|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-525963930, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-525963930} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-525963930|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-525963930, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-525963930} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:47:30,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:47:30,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1477736940| |P2Thread1of1ForFork0_#t~ite39_Out1477736940|)) (.cse1 (= (mod ~z$w_buff1_used~0_In1477736940 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1477736940 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1477736940| ~z~0_In1477736940) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1477736940| ~z$w_buff1~0_In1477736940) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1477736940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1477736940, ~z$w_buff1~0=~z$w_buff1~0_In1477736940, ~z~0=~z~0_In1477736940} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1477736940|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1477736940|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1477736940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1477736940, ~z$w_buff1~0=~z$w_buff1~0_In1477736940, ~z~0=~z~0_In1477736940} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:47:30,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1461148915 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1461148915 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1461148915| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1461148915| ~z$w_buff0_used~0_In-1461148915) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1461148915, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1461148915} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1461148915, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1461148915|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1461148915} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:47:30,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In2110712697 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2110712697 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In2110712697 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2110712697 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out2110712697| ~z$w_buff1_used~0_In2110712697) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out2110712697| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2110712697, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2110712697, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2110712697, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2110712697} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2110712697, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2110712697, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2110712697, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2110712697, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out2110712697|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:47:30,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-354702341 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-354702341 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-354702341| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-354702341| ~z$r_buff0_thd3~0_In-354702341) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-354702341, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-354702341} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-354702341, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-354702341, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-354702341|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:47:30,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1250468876 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1250468876 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1250468876 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1250468876 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out-1250468876| ~z$r_buff1_thd3~0_In-1250468876) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1250468876| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1250468876, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1250468876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1250468876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1250468876} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1250468876|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1250468876, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1250468876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1250468876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1250468876} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:47:30,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:47:30,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1323849154 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1323849154 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1323849154 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1323849154 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1323849154| ~z$w_buff1_used~0_In-1323849154) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1323849154| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323849154, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1323849154, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1323849154, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1323849154} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323849154, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1323849154|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1323849154, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1323849154, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1323849154} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:47:30,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In764711368 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In764711368 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out764711368) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In764711368 ~z$r_buff0_thd1~0_Out764711368)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In764711368, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In764711368} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In764711368, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out764711368|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out764711368} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:47:30,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1489014090 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1489014090 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1489014090 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1489014090 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1489014090| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1489014090| ~z$r_buff1_thd1~0_In-1489014090) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489014090, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1489014090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489014090, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1489014090} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1489014090|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489014090, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1489014090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489014090, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1489014090} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:47:30,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:47:30,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1421129402 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1421129402 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-1421129402 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1421129402 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1421129402| ~z$r_buff1_thd2~0_In-1421129402) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1421129402| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421129402, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1421129402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1421129402, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1421129402} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421129402, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1421129402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1421129402, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1421129402|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1421129402} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:47:30,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:47:30,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:47:30,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-1803618888| |ULTIMATE.start_main_#t~ite47_Out-1803618888|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1803618888 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1803618888 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~z$w_buff1~0_In-1803618888 |ULTIMATE.start_main_#t~ite47_Out-1803618888|)) (and .cse1 (= ~z~0_In-1803618888 |ULTIMATE.start_main_#t~ite47_Out-1803618888|) (or .cse2 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1803618888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1803618888, ~z$w_buff1~0=~z$w_buff1~0_In-1803618888, ~z~0=~z~0_In-1803618888} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1803618888, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1803618888|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1803618888, ~z$w_buff1~0=~z$w_buff1~0_In-1803618888, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1803618888|, ~z~0=~z~0_In-1803618888} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:47:30,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1695750034 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1695750034 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1695750034| ~z$w_buff0_used~0_In1695750034) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out1695750034| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1695750034, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1695750034} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1695750034, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1695750034, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1695750034|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:47:30,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1587142159 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1587142159 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1587142159 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1587142159 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1587142159| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1587142159 |ULTIMATE.start_main_#t~ite50_Out-1587142159|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1587142159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587142159, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1587142159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1587142159} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1587142159|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1587142159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587142159, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1587142159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1587142159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:47:30,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1624572549 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1624572549 256)))) (or (and (= ~z$r_buff0_thd0~0_In1624572549 |ULTIMATE.start_main_#t~ite51_Out1624572549|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1624572549| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1624572549, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1624572549} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1624572549, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1624572549|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1624572549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:47:30,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In146397386 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In146397386 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In146397386 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In146397386 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In146397386 |ULTIMATE.start_main_#t~ite52_Out146397386|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out146397386| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In146397386, ~z$w_buff0_used~0=~z$w_buff0_used~0_In146397386, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In146397386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In146397386} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out146397386|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In146397386, ~z$w_buff0_used~0=~z$w_buff0_used~0_In146397386, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In146397386, ~z$w_buff1_used~0=~z$w_buff1_used~0_In146397386} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:47:30,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:47:30,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:47:30 BasicIcfg [2019-12-18 13:47:30,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:47:30,581 INFO L168 Benchmark]: Toolchain (without parser) took 172082.74 ms. Allocated memory was 146.3 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 102.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 13:47:30,581 INFO L168 Benchmark]: CDTParser took 1.65 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:47:30,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.34 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 157.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:30,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.30 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:30,583 INFO L168 Benchmark]: Boogie Preprocessor took 46.22 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:30,587 INFO L168 Benchmark]: RCFGBuilder took 860.43 ms. Allocated memory is still 203.9 MB. Free memory was 152.4 MB in the beginning and 102.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:47:30,588 INFO L168 Benchmark]: TraceAbstraction took 170294.02 ms. Allocated memory was 203.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 13:47:30,595 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.65 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.34 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 157.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.30 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.22 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 860.43 ms. Allocated memory is still 203.9 MB. Free memory was 152.4 MB in the beginning and 102.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 170294.02 ms. Allocated memory was 203.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1312, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] 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_p0_EAX=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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1313, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 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=0, __unbuffered_p0_EAX=0, __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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1314, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=7, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 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 [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=7, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 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) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, 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=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 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 [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 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 [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 169.9s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 92.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8470 SDtfs, 11166 SDslu, 42171 SDs, 0 SdLazy, 59245 SolverSat, 883 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 50.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 46 SyntacticMatches, 20 SemanticMatches, 578 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6758 ImplicationChecksByTransitivity, 18.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 253664 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1529 NumberOfCodeBlocks, 1529 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1433 ConstructedInterpolants, 0 QuantifiedInterpolants, 563277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...