/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/mix035_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:18:15,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:18:15,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:18:15,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:18:15,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:18:15,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:18:15,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:18:15,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:18:15,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:18:15,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:18:15,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:18:15,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:18:15,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:18:15,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:18:15,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:18:15,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:18:15,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:18:15,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:18:15,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:18:15,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:18:15,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:18:15,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:18:15,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:18:15,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:18:15,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:18:15,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:18:15,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:18:15,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:18:15,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:18:15,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:18:15,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:18:15,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:18:15,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:18:15,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:18:15,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:18:15,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:18:15,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:18:15,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:18:15,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:18:15,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:18:15,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:18:15,468 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:18:15,482 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:18:15,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:18:15,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:18:15,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:18:15,484 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:18:15,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:18:15,485 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:18:15,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:18:15,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:18:15,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:18:15,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:18:15,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:18:15,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:18:15,486 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:18:15,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:18:15,486 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:18:15,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:18:15,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:18:15,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:18:15,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:18:15,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:18:15,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:18:15,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:18:15,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:18:15,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:18:15,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:18:15,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:18:15,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:18:15,489 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:18:15,489 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:18:15,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:18:15,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:18:15,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:18:15,782 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:18:15,782 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:18:15,783 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.oepc.i [2019-12-18 13:18:15,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8e3b2668/4e02277e6211407ba0e876e3165e2638/FLAG65ef0dbdc [2019-12-18 13:18:16,397 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:18:16,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.oepc.i [2019-12-18 13:18:16,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8e3b2668/4e02277e6211407ba0e876e3165e2638/FLAG65ef0dbdc [2019-12-18 13:18:16,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8e3b2668/4e02277e6211407ba0e876e3165e2638 [2019-12-18 13:18:16,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:18:16,647 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:18:16,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:18:16,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:18:16,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:18:16,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:18:16" (1/1) ... [2019-12-18 13:18:16,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a77478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:16, skipping insertion in model container [2019-12-18 13:18:16,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:18:16" (1/1) ... [2019-12-18 13:18:16,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:18:16,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:18:17,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:18:17,267 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:18:17,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:18:17,439 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:18:17,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:17 WrapperNode [2019-12-18 13:18:17,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:18:17,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:18:17,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:18:17,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:18:17,449 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:18:17" (1/1) ... [2019-12-18 13:18:17,472 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:18:17" (1/1) ... [2019-12-18 13:18:17,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:18:17,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:18:17,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:18:17,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:18:17,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:17" (1/1) ... [2019-12-18 13:18:17,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:17" (1/1) ... [2019-12-18 13:18:17,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:17" (1/1) ... [2019-12-18 13:18:17,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:17" (1/1) ... [2019-12-18 13:18:17,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:17" (1/1) ... [2019-12-18 13:18:17,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:17" (1/1) ... [2019-12-18 13:18:17,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:17" (1/1) ... [2019-12-18 13:18:17,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:18:17,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:18:17,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:18:17,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:18:17,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:17" (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:18:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:18:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:18:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:18:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:18:17,621 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:18:17,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:18:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:18:17,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:18:17,622 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:18:17,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:18:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:18:17,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:18:17,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:18:17,625 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:18:18,378 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:18:18,379 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:18:18,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:18:18 BoogieIcfgContainer [2019-12-18 13:18:18,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:18:18,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:18:18,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:18:18,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:18:18,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:18:16" (1/3) ... [2019-12-18 13:18:18,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1b8321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:18:18, skipping insertion in model container [2019-12-18 13:18:18,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:18:17" (2/3) ... [2019-12-18 13:18:18,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1b8321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:18:18, skipping insertion in model container [2019-12-18 13:18:18,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:18:18" (3/3) ... [2019-12-18 13:18:18,391 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_pso.oepc.i [2019-12-18 13:18:18,401 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:18:18,402 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:18:18,409 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:18:18,410 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:18:18,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,476 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,477 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,491 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,491 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,538 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,540 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,549 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,554 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,555 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:18:18,572 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:18:18,591 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:18:18,591 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:18:18,592 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:18:18,592 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:18:18,592 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:18:18,592 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:18:18,592 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:18:18,592 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:18:18,607 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 13:18:18,609 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 13:18:18,714 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 13:18:18,714 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:18:18,733 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:18:18,760 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 13:18:18,806 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 13:18:18,806 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:18:18,814 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:18:18,836 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:18:18,837 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:18:23,497 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-18 13:18:24,129 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 13:18:24,260 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 13:18:24,382 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-18 13:18:24,382 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 13:18:24,386 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 13:18:42,503 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-18 13:18:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-18 13:18:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:18:42,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:42,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:18:42,511 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:18:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-18 13:18:42,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:42,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311818827] [2019-12-18 13:18:42,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:42,762 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:18:42,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311818827] [2019-12-18 13:18:42,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:42,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:18:42,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615514428] [2019-12-18 13:18:42,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:18:42,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:42,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:18:42,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:18:42,795 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-18 13:18:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:18:47,080 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-18 13:18:47,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:18:47,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:18:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:18:47,901 INFO L225 Difference]: With dead ends: 117122 [2019-12-18 13:18:47,901 INFO L226 Difference]: Without dead ends: 109842 [2019-12-18 13:18:47,902 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:18:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-18 13:18:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-18 13:18:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-18 13:18:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-18 13:18:56,065 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-18 13:18:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:18:56,065 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-18 13:18:56,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:18:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-18 13:18:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:18:56,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:18:56,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:18:56,071 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:18:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:18:56,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-18 13:18:56,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:18:56,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194723174] [2019-12-18 13:18:56,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:18:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:18:56,236 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:18:56,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194723174] [2019-12-18 13:18:56,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:18:56,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:18:56,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175766736] [2019-12-18 13:18:56,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:18:56,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:18:56,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:18:56,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:18:56,239 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-18 13:19:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:01,458 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-18 13:19:01,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:01,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:19:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:02,144 INFO L225 Difference]: With dead ends: 170700 [2019-12-18 13:19:02,144 INFO L226 Difference]: Without dead ends: 170651 [2019-12-18 13:19:02,145 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:19:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-18 13:19:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-18 13:19:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-18 13:19:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-18 13:19:14,742 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-18 13:19:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:14,742 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-18 13:19:14,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-18 13:19:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:19:14,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:14,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:14,750 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:19:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:14,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-18 13:19:14,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:14,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361438322] [2019-12-18 13:19:14,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:14,812 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:19:14,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361438322] [2019-12-18 13:19:14,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:14,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:14,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486178599] [2019-12-18 13:19:14,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:14,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:14,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:14,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:14,815 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-18 13:19:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:19,644 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-18 13:19:19,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:19,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:19:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:19,712 INFO L225 Difference]: With dead ends: 33806 [2019-12-18 13:19:19,712 INFO L226 Difference]: Without dead ends: 33806 [2019-12-18 13:19:19,713 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:19:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-18 13:19:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-18 13:19:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-18 13:19:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-18 13:19:20,334 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-18 13:19:20,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:20,334 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-18 13:19:20,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-18 13:19:20,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:19:20,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:20,338 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:19:20,338 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:19:20,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:20,339 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-18 13:19:20,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:20,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891515711] [2019-12-18 13:19:20,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:20,392 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:19:20,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891515711] [2019-12-18 13:19:20,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:20,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:20,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421346841] [2019-12-18 13:19:20,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:20,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:20,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:20,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:20,394 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-18 13:19:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:20,603 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-18 13:19:20,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:20,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 13:19:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:20,689 INFO L225 Difference]: With dead ends: 52205 [2019-12-18 13:19:20,689 INFO L226 Difference]: Without dead ends: 52205 [2019-12-18 13:19:20,690 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:19:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-18 13:19:21,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-18 13:19:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-18 13:19:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-18 13:19:21,746 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-18 13:19:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:21,747 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-18 13:19:21,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-18 13:19:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:19:21,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:21,751 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:19:21,751 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:19:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-18 13:19:21,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:21,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218634784] [2019-12-18 13:19:21,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:21,863 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:19:21,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218634784] [2019-12-18 13:19:21,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:21,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:21,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384013507] [2019-12-18 13:19:21,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:19:21,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:19:21,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:21,866 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-18 13:19:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:22,245 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-18 13:19:22,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:22,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:19:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:22,321 INFO L225 Difference]: With dead ends: 46485 [2019-12-18 13:19:22,321 INFO L226 Difference]: Without dead ends: 46485 [2019-12-18 13:19:22,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-18 13:19:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-18 13:19:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-18 13:19:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-18 13:19:23,070 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-18 13:19:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:23,071 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-18 13:19:23,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-18 13:19:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:19:23,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:23,075 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:19:23,075 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:19:23,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:23,075 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-18 13:19:23,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:23,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683753354] [2019-12-18 13:19:23,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:19:23,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683753354] [2019-12-18 13:19:23,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:23,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:23,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909503007] [2019-12-18 13:19:23,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:19:23,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:23,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:19:23,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:23,146 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-18 13:19:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:23,731 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-18 13:19:23,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:23,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:19:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:23,819 INFO L225 Difference]: With dead ends: 51005 [2019-12-18 13:19:23,820 INFO L226 Difference]: Without dead ends: 51005 [2019-12-18 13:19:23,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-18 13:19:24,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-18 13:19:24,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-18 13:19:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-18 13:19:24,621 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-18 13:19:24,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:24,622 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-18 13:19:24,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-18 13:19:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:19:24,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:24,632 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:19:24,632 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:19:24,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-18 13:19:24,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:24,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002943820] [2019-12-18 13:19:24,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:24,757 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:19:24,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002943820] [2019-12-18 13:19:24,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:24,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:24,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734033556] [2019-12-18 13:19:24,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:24,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:24,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:24,761 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 5 states. [2019-12-18 13:19:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:25,470 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-18 13:19:25,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:19:25,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:19:25,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:25,583 INFO L225 Difference]: With dead ends: 60565 [2019-12-18 13:19:25,583 INFO L226 Difference]: Without dead ends: 60558 [2019-12-18 13:19:25,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:19:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-18 13:19:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-18 13:19:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-18 13:19:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-18 13:19:26,807 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-18 13:19:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:26,807 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-18 13:19:26,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-18 13:19:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:19:26,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:26,817 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:19:26,817 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:19:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:26,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-18 13:19:26,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:26,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890593480] [2019-12-18 13:19:26,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:26,909 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:19:26,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890593480] [2019-12-18 13:19:26,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:26,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:26,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557138376] [2019-12-18 13:19:26,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:26,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:26,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:26,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:26,912 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 5 states. [2019-12-18 13:19:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:27,627 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-18 13:19:27,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:19:27,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:19:27,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:27,747 INFO L225 Difference]: With dead ends: 63360 [2019-12-18 13:19:27,747 INFO L226 Difference]: Without dead ends: 63353 [2019-12-18 13:19:27,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:19:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-18 13:19:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-18 13:19:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-18 13:19:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-18 13:19:29,038 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-18 13:19:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:29,039 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-18 13:19:29,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-18 13:19:29,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:19:29,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:29,050 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:19:29,051 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:19:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:29,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-18 13:19:29,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:29,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859557716] [2019-12-18 13:19:29,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:29,101 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:19:29,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859557716] [2019-12-18 13:19:29,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:29,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:29,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745598518] [2019-12-18 13:19:29,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:19:29,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:29,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:19:29,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:19:29,103 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 4 states. [2019-12-18 13:19:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:29,178 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-18 13:19:29,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:19:29,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:19:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:29,203 INFO L225 Difference]: With dead ends: 18121 [2019-12-18 13:19:29,204 INFO L226 Difference]: Without dead ends: 18121 [2019-12-18 13:19:29,204 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:19:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-18 13:19:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-18 13:19:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-18 13:19:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-18 13:19:29,469 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-18 13:19:29,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:29,470 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-18 13:19:29,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:19:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-18 13:19:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:19:29,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:29,483 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:19:29,484 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:19:29,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:29,484 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-18 13:19:29,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:29,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781795470] [2019-12-18 13:19:29,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:29,522 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:19:29,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781795470] [2019-12-18 13:19:29,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:29,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:29,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333691503] [2019-12-18 13:19:29,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:29,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:29,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:29,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:29,524 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-18 13:19:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:29,656 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-18 13:19:29,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:29,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:19:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:29,703 INFO L225 Difference]: With dead ends: 23499 [2019-12-18 13:19:29,704 INFO L226 Difference]: Without dead ends: 23499 [2019-12-18 13:19:29,704 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:19:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-18 13:19:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-18 13:19:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-18 13:19:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-18 13:19:30,151 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-18 13:19:30,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:30,151 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-18 13:19:30,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-18 13:19:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:19:30,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:30,168 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:19:30,168 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:19:30,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:30,169 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-18 13:19:30,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:30,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950431537] [2019-12-18 13:19:30,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:30,267 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:19:30,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950431537] [2019-12-18 13:19:30,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:30,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:30,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810335563] [2019-12-18 13:19:30,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:30,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:30,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:30,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:30,269 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-18 13:19:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:30,619 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-18 13:19:30,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:19:30,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 13:19:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:30,647 INFO L225 Difference]: With dead ends: 21964 [2019-12-18 13:19:30,649 INFO L226 Difference]: Without dead ends: 21964 [2019-12-18 13:19:30,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-18 13:19:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-18 13:19:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-18 13:19:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-18 13:19:31,063 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-18 13:19:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:31,063 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-18 13:19:31,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-18 13:19:31,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:19:31,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:31,078 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] [2019-12-18 13:19:31,078 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:19:31,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:31,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-18 13:19:31,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:31,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688818245] [2019-12-18 13:19:31,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:31,200 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:19:31,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688818245] [2019-12-18 13:19:31,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:31,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:19:31,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35707117] [2019-12-18 13:19:31,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:31,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:31,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:31,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:31,203 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-18 13:19:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:31,346 INFO L93 Difference]: Finished difference Result 20911 states and 61888 transitions. [2019-12-18 13:19:31,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:31,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 13:19:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:31,380 INFO L225 Difference]: With dead ends: 20911 [2019-12-18 13:19:31,380 INFO L226 Difference]: Without dead ends: 20911 [2019-12-18 13:19:31,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20911 states. [2019-12-18 13:19:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20911 to 20911. [2019-12-18 13:19:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20911 states. [2019-12-18 13:19:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 61888 transitions. [2019-12-18 13:19:31,671 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 61888 transitions. Word has length 28 [2019-12-18 13:19:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:31,672 INFO L462 AbstractCegarLoop]: Abstraction has 20911 states and 61888 transitions. [2019-12-18 13:19:31,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 61888 transitions. [2019-12-18 13:19:31,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:19:31,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:31,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:31,688 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:19:31,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:31,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1714199023, now seen corresponding path program 1 times [2019-12-18 13:19:31,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:31,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995277479] [2019-12-18 13:19:31,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:31,766 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:19:31,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995277479] [2019-12-18 13:19:31,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:31,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:19:31,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071880233] [2019-12-18 13:19:31,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:31,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:31,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:31,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:31,768 INFO L87 Difference]: Start difference. First operand 20911 states and 61888 transitions. Second operand 5 states. [2019-12-18 13:19:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:32,159 INFO L93 Difference]: Finished difference Result 24383 states and 71254 transitions. [2019-12-18 13:19:32,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:19:32,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 13:19:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:32,192 INFO L225 Difference]: With dead ends: 24383 [2019-12-18 13:19:32,192 INFO L226 Difference]: Without dead ends: 24383 [2019-12-18 13:19:32,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24383 states. [2019-12-18 13:19:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24383 to 21026. [2019-12-18 13:19:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21026 states. [2019-12-18 13:19:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21026 states to 21026 states and 62164 transitions. [2019-12-18 13:19:32,508 INFO L78 Accepts]: Start accepts. Automaton has 21026 states and 62164 transitions. Word has length 29 [2019-12-18 13:19:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:32,509 INFO L462 AbstractCegarLoop]: Abstraction has 21026 states and 62164 transitions. [2019-12-18 13:19:32,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 21026 states and 62164 transitions. [2019-12-18 13:19:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:19:32,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:32,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:32,529 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:19:32,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:32,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-18 13:19:32,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:32,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015537050] [2019-12-18 13:19:32,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:32,630 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:19:32,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015537050] [2019-12-18 13:19:32,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:32,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:19:32,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878711936] [2019-12-18 13:19:32,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:19:32,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:32,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:19:32,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:19:32,632 INFO L87 Difference]: Start difference. First operand 21026 states and 62164 transitions. Second operand 6 states. [2019-12-18 13:19:33,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:33,342 INFO L93 Difference]: Finished difference Result 27860 states and 80966 transitions. [2019-12-18 13:19:33,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:19:33,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 13:19:33,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:33,380 INFO L225 Difference]: With dead ends: 27860 [2019-12-18 13:19:33,380 INFO L226 Difference]: Without dead ends: 27860 [2019-12-18 13:19:33,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:19:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27860 states. [2019-12-18 13:19:33,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27860 to 22078. [2019-12-18 13:19:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22078 states. [2019-12-18 13:19:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22078 states to 22078 states and 65194 transitions. [2019-12-18 13:19:33,870 INFO L78 Accepts]: Start accepts. Automaton has 22078 states and 65194 transitions. Word has length 33 [2019-12-18 13:19:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:33,871 INFO L462 AbstractCegarLoop]: Abstraction has 22078 states and 65194 transitions. [2019-12-18 13:19:33,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:19:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 22078 states and 65194 transitions. [2019-12-18 13:19:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 13:19:33,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:33,888 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] [2019-12-18 13:19:33,889 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:19:33,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:33,889 INFO L82 PathProgramCache]: Analyzing trace with hash -617380767, now seen corresponding path program 1 times [2019-12-18 13:19:33,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:33,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059661724] [2019-12-18 13:19:33,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:33,969 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:19:33,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059661724] [2019-12-18 13:19:33,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:33,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:19:33,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119953862] [2019-12-18 13:19:33,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:19:33,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:33,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:19:33,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:19:33,971 INFO L87 Difference]: Start difference. First operand 22078 states and 65194 transitions. Second operand 6 states. [2019-12-18 13:19:34,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:34,726 INFO L93 Difference]: Finished difference Result 27029 states and 78779 transitions. [2019-12-18 13:19:34,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:19:34,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 13:19:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:34,775 INFO L225 Difference]: With dead ends: 27029 [2019-12-18 13:19:34,775 INFO L226 Difference]: Without dead ends: 27029 [2019-12-18 13:19:34,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:19:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27029 states. [2019-12-18 13:19:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27029 to 19090. [2019-12-18 13:19:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19090 states. [2019-12-18 13:19:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19090 states to 19090 states and 56687 transitions. [2019-12-18 13:19:35,110 INFO L78 Accepts]: Start accepts. Automaton has 19090 states and 56687 transitions. Word has length 35 [2019-12-18 13:19:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:35,111 INFO L462 AbstractCegarLoop]: Abstraction has 19090 states and 56687 transitions. [2019-12-18 13:19:35,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:19:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 19090 states and 56687 transitions. [2019-12-18 13:19:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:19:35,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:35,130 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:19:35,130 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:19:35,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:35,130 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-18 13:19:35,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:35,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33447221] [2019-12-18 13:19:35,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:35,185 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:19:35,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33447221] [2019-12-18 13:19:35,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:35,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:19:35,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783818448] [2019-12-18 13:19:35,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:35,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:35,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:35,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:35,187 INFO L87 Difference]: Start difference. First operand 19090 states and 56687 transitions. Second operand 3 states. [2019-12-18 13:19:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:35,264 INFO L93 Difference]: Finished difference Result 19089 states and 56685 transitions. [2019-12-18 13:19:35,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:35,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:19:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:35,299 INFO L225 Difference]: With dead ends: 19089 [2019-12-18 13:19:35,299 INFO L226 Difference]: Without dead ends: 19089 [2019-12-18 13:19:35,300 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:19:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19089 states. [2019-12-18 13:19:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19089 to 19089. [2019-12-18 13:19:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19089 states. [2019-12-18 13:19:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19089 states to 19089 states and 56685 transitions. [2019-12-18 13:19:35,600 INFO L78 Accepts]: Start accepts. Automaton has 19089 states and 56685 transitions. Word has length 39 [2019-12-18 13:19:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:35,601 INFO L462 AbstractCegarLoop]: Abstraction has 19089 states and 56685 transitions. [2019-12-18 13:19:35,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 19089 states and 56685 transitions. [2019-12-18 13:19:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:19:35,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:35,624 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] [2019-12-18 13:19:35,624 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:19:35,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:35,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1129418560, now seen corresponding path program 1 times [2019-12-18 13:19:35,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:35,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368062697] [2019-12-18 13:19:35,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:35,696 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:19:35,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368062697] [2019-12-18 13:19:35,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:35,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:19:35,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523365400] [2019-12-18 13:19:35,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:35,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:35,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:35,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:35,698 INFO L87 Difference]: Start difference. First operand 19089 states and 56685 transitions. Second operand 5 states. [2019-12-18 13:19:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:36,309 INFO L93 Difference]: Finished difference Result 27483 states and 80802 transitions. [2019-12-18 13:19:36,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:19:36,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:19:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:36,347 INFO L225 Difference]: With dead ends: 27483 [2019-12-18 13:19:36,347 INFO L226 Difference]: Without dead ends: 27483 [2019-12-18 13:19:36,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:19:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27483 states. [2019-12-18 13:19:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27483 to 25378. [2019-12-18 13:19:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25378 states. [2019-12-18 13:19:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25378 states to 25378 states and 75084 transitions. [2019-12-18 13:19:36,987 INFO L78 Accepts]: Start accepts. Automaton has 25378 states and 75084 transitions. Word has length 40 [2019-12-18 13:19:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:36,988 INFO L462 AbstractCegarLoop]: Abstraction has 25378 states and 75084 transitions. [2019-12-18 13:19:36,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 25378 states and 75084 transitions. [2019-12-18 13:19:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:19:37,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:37,013 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] [2019-12-18 13:19:37,013 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:19:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:37,013 INFO L82 PathProgramCache]: Analyzing trace with hash -554035702, now seen corresponding path program 2 times [2019-12-18 13:19:37,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:37,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242196600] [2019-12-18 13:19:37,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:37,084 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:19:37,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242196600] [2019-12-18 13:19:37,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:37,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:37,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257047049] [2019-12-18 13:19:37,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:37,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:37,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:37,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:37,086 INFO L87 Difference]: Start difference. First operand 25378 states and 75084 transitions. Second operand 3 states. [2019-12-18 13:19:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:37,188 INFO L93 Difference]: Finished difference Result 25378 states and 75005 transitions. [2019-12-18 13:19:37,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:37,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 13:19:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:37,235 INFO L225 Difference]: With dead ends: 25378 [2019-12-18 13:19:37,235 INFO L226 Difference]: Without dead ends: 25378 [2019-12-18 13:19:37,236 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:19:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25378 states. [2019-12-18 13:19:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25378 to 21127. [2019-12-18 13:19:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21127 states. [2019-12-18 13:19:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21127 states to 21127 states and 63266 transitions. [2019-12-18 13:19:37,601 INFO L78 Accepts]: Start accepts. Automaton has 21127 states and 63266 transitions. Word has length 40 [2019-12-18 13:19:37,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:37,601 INFO L462 AbstractCegarLoop]: Abstraction has 21127 states and 63266 transitions. [2019-12-18 13:19:37,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 21127 states and 63266 transitions. [2019-12-18 13:19:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:19:37,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:37,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:19:37,620 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:19:37,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:37,620 INFO L82 PathProgramCache]: Analyzing trace with hash -559165763, now seen corresponding path program 1 times [2019-12-18 13:19:37,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:37,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037706373] [2019-12-18 13:19:37,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:37,664 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:19:37,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037706373] [2019-12-18 13:19:37,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:37,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:19:37,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923786884] [2019-12-18 13:19:37,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:19:37,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:37,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:19:37,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:19:37,666 INFO L87 Difference]: Start difference. First operand 21127 states and 63266 transitions. Second operand 5 states. [2019-12-18 13:19:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:37,755 INFO L93 Difference]: Finished difference Result 19886 states and 60599 transitions. [2019-12-18 13:19:37,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:19:37,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 13:19:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:37,792 INFO L225 Difference]: With dead ends: 19886 [2019-12-18 13:19:37,792 INFO L226 Difference]: Without dead ends: 19886 [2019-12-18 13:19:37,793 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:19:37,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19886 states. [2019-12-18 13:19:38,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19886 to 19886. [2019-12-18 13:19:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19886 states. [2019-12-18 13:19:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19886 states to 19886 states and 60599 transitions. [2019-12-18 13:19:38,096 INFO L78 Accepts]: Start accepts. Automaton has 19886 states and 60599 transitions. Word has length 41 [2019-12-18 13:19:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:38,097 INFO L462 AbstractCegarLoop]: Abstraction has 19886 states and 60599 transitions. [2019-12-18 13:19:38,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:19:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 19886 states and 60599 transitions. [2019-12-18 13:19:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:19:38,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:38,116 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:19:38,116 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:19:38,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1104102808, now seen corresponding path program 1 times [2019-12-18 13:19:38,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:38,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515713234] [2019-12-18 13:19:38,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:38,193 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:19:38,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515713234] [2019-12-18 13:19:38,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:38,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:19:38,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357028381] [2019-12-18 13:19:38,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:19:38,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:38,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:19:38,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:38,195 INFO L87 Difference]: Start difference. First operand 19886 states and 60599 transitions. Second operand 7 states. [2019-12-18 13:19:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:38,678 INFO L93 Difference]: Finished difference Result 56173 states and 169762 transitions. [2019-12-18 13:19:38,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:19:38,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:19:38,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:38,737 INFO L225 Difference]: With dead ends: 56173 [2019-12-18 13:19:38,737 INFO L226 Difference]: Without dead ends: 43296 [2019-12-18 13:19:38,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:19:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43296 states. [2019-12-18 13:19:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43296 to 23308. [2019-12-18 13:19:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23308 states. [2019-12-18 13:19:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23308 states to 23308 states and 71016 transitions. [2019-12-18 13:19:39,479 INFO L78 Accepts]: Start accepts. Automaton has 23308 states and 71016 transitions. Word has length 65 [2019-12-18 13:19:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:39,479 INFO L462 AbstractCegarLoop]: Abstraction has 23308 states and 71016 transitions. [2019-12-18 13:19:39,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:19:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 23308 states and 71016 transitions. [2019-12-18 13:19:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:19:39,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:39,506 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:19:39,506 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:19:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1989977016, now seen corresponding path program 2 times [2019-12-18 13:19:39,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:39,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29300289] [2019-12-18 13:19:39,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:39,579 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:19:39,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29300289] [2019-12-18 13:19:39,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:39,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:19:39,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167587674] [2019-12-18 13:19:39,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:19:39,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:39,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:19:39,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:39,581 INFO L87 Difference]: Start difference. First operand 23308 states and 71016 transitions. Second operand 7 states. [2019-12-18 13:19:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:40,103 INFO L93 Difference]: Finished difference Result 62282 states and 186068 transitions. [2019-12-18 13:19:40,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:19:40,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:19:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:40,163 INFO L225 Difference]: With dead ends: 62282 [2019-12-18 13:19:40,163 INFO L226 Difference]: Without dead ends: 44545 [2019-12-18 13:19:40,164 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:19:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44545 states. [2019-12-18 13:19:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44545 to 27350. [2019-12-18 13:19:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27350 states. [2019-12-18 13:19:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27350 states to 27350 states and 82398 transitions. [2019-12-18 13:19:40,691 INFO L78 Accepts]: Start accepts. Automaton has 27350 states and 82398 transitions. Word has length 65 [2019-12-18 13:19:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:40,691 INFO L462 AbstractCegarLoop]: Abstraction has 27350 states and 82398 transitions. [2019-12-18 13:19:40,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:19:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 27350 states and 82398 transitions. [2019-12-18 13:19:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:19:40,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:40,717 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:19:40,717 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:19:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash 982875086, now seen corresponding path program 3 times [2019-12-18 13:19:40,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:40,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57645799] [2019-12-18 13:19:40,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:40,797 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:19:40,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57645799] [2019-12-18 13:19:40,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:40,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:19:40,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394069731] [2019-12-18 13:19:40,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:19:40,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:40,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:19:40,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:19:40,799 INFO L87 Difference]: Start difference. First operand 27350 states and 82398 transitions. Second operand 7 states. [2019-12-18 13:19:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:41,337 INFO L93 Difference]: Finished difference Result 54026 states and 160947 transitions. [2019-12-18 13:19:41,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:19:41,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 13:19:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:41,419 INFO L225 Difference]: With dead ends: 54026 [2019-12-18 13:19:41,419 INFO L226 Difference]: Without dead ends: 47313 [2019-12-18 13:19:41,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:19:41,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47313 states. [2019-12-18 13:19:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47313 to 27658. [2019-12-18 13:19:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27658 states. [2019-12-18 13:19:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27658 states to 27658 states and 83349 transitions. [2019-12-18 13:19:42,467 INFO L78 Accepts]: Start accepts. Automaton has 27658 states and 83349 transitions. Word has length 65 [2019-12-18 13:19:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:42,467 INFO L462 AbstractCegarLoop]: Abstraction has 27658 states and 83349 transitions. [2019-12-18 13:19:42,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:19:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 27658 states and 83349 transitions. [2019-12-18 13:19:42,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:19:42,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:42,509 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:19:42,510 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:19:42,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:42,510 INFO L82 PathProgramCache]: Analyzing trace with hash -156874998, now seen corresponding path program 4 times [2019-12-18 13:19:42,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:42,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739352110] [2019-12-18 13:19:42,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:42,562 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:19:42,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739352110] [2019-12-18 13:19:42,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:42,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:42,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686110559] [2019-12-18 13:19:42,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:42,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:42,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:42,565 INFO L87 Difference]: Start difference. First operand 27658 states and 83349 transitions. Second operand 3 states. [2019-12-18 13:19:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:42,880 INFO L93 Difference]: Finished difference Result 30812 states and 92747 transitions. [2019-12-18 13:19:42,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:42,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:19:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:42,929 INFO L225 Difference]: With dead ends: 30812 [2019-12-18 13:19:42,929 INFO L226 Difference]: Without dead ends: 30812 [2019-12-18 13:19:42,929 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:19:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30812 states. [2019-12-18 13:19:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30812 to 25037. [2019-12-18 13:19:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25037 states. [2019-12-18 13:19:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25037 states to 25037 states and 76106 transitions. [2019-12-18 13:19:43,342 INFO L78 Accepts]: Start accepts. Automaton has 25037 states and 76106 transitions. Word has length 65 [2019-12-18 13:19:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:43,343 INFO L462 AbstractCegarLoop]: Abstraction has 25037 states and 76106 transitions. [2019-12-18 13:19:43,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 25037 states and 76106 transitions. [2019-12-18 13:19:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:19:43,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:43,369 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:19:43,369 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:19:43,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:43,370 INFO L82 PathProgramCache]: Analyzing trace with hash 771503262, now seen corresponding path program 1 times [2019-12-18 13:19:43,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:43,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257071999] [2019-12-18 13:19:43,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:43,420 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:19:43,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257071999] [2019-12-18 13:19:43,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:43,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:19:43,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834353454] [2019-12-18 13:19:43,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:19:43,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:43,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:19:43,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:19:43,424 INFO L87 Difference]: Start difference. First operand 25037 states and 76106 transitions. Second operand 3 states. [2019-12-18 13:19:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:43,510 INFO L93 Difference]: Finished difference Result 20969 states and 62663 transitions. [2019-12-18 13:19:43,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:19:43,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:19:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:43,548 INFO L225 Difference]: With dead ends: 20969 [2019-12-18 13:19:43,549 INFO L226 Difference]: Without dead ends: 20969 [2019-12-18 13:19:43,549 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:19:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20969 states. [2019-12-18 13:19:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20969 to 19009. [2019-12-18 13:19:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19009 states. [2019-12-18 13:19:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19009 states to 19009 states and 56843 transitions. [2019-12-18 13:19:44,053 INFO L78 Accepts]: Start accepts. Automaton has 19009 states and 56843 transitions. Word has length 66 [2019-12-18 13:19:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:44,053 INFO L462 AbstractCegarLoop]: Abstraction has 19009 states and 56843 transitions. [2019-12-18 13:19:44,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:19:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 19009 states and 56843 transitions. [2019-12-18 13:19:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:19:44,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:44,079 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:19:44,079 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:19:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:44,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-18 13:19:44,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:44,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567361704] [2019-12-18 13:19:44,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:19:44,308 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:19:44,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567361704] [2019-12-18 13:19:44,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:19:44,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:19:44,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033924750] [2019-12-18 13:19:44,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:19:44,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:19:44,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:19:44,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:19:44,310 INFO L87 Difference]: Start difference. First operand 19009 states and 56843 transitions. Second operand 11 states. [2019-12-18 13:19:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:19:45,504 INFO L93 Difference]: Finished difference Result 43638 states and 129396 transitions. [2019-12-18 13:19:45,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 13:19:45,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:19:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:19:45,548 INFO L225 Difference]: With dead ends: 43638 [2019-12-18 13:19:45,548 INFO L226 Difference]: Without dead ends: 32919 [2019-12-18 13:19:45,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 13:19:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32919 states. [2019-12-18 13:19:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32919 to 18279. [2019-12-18 13:19:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18279 states. [2019-12-18 13:19:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18279 states to 18279 states and 54342 transitions. [2019-12-18 13:19:45,913 INFO L78 Accepts]: Start accepts. Automaton has 18279 states and 54342 transitions. Word has length 67 [2019-12-18 13:19:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:19:45,913 INFO L462 AbstractCegarLoop]: Abstraction has 18279 states and 54342 transitions. [2019-12-18 13:19:45,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:19:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 18279 states and 54342 transitions. [2019-12-18 13:19:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:19:45,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:19:45,931 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:19:45,931 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:19:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:19:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 2 times [2019-12-18 13:19:45,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:19:45,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93937268] [2019-12-18 13:19:45,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:19:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:19:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:19:46,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:19:46,104 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:19:46,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t919~0.base_30|) 0) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= |v_ULTIMATE.start_main_~#t919~0.offset_22| 0) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= v_~main$tmp_guard0~0_25 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t919~0.base_30| 4)) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t919~0.base_30|) (= 0 v_~a$w_buff1_used~0_450) (= 0 v_~__unbuffered_p0_EAX~0_159) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t919~0.base_30| 1)) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= v_~a$mem_tmp~0_16 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t919~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t919~0.base_30|) |v_ULTIMATE.start_main_~#t919~0.offset_22| 0)) |v_#memory_int_19|) (= 0 v_~x~0_153) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_~#t919~0.offset=|v_ULTIMATE.start_main_~#t919~0.offset_22|, ULTIMATE.start_main_~#t921~0.offset=|v_ULTIMATE.start_main_~#t921~0.offset_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ULTIMATE.start_main_~#t920~0.base=|v_ULTIMATE.start_main_~#t920~0.base_23|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ULTIMATE.start_main_~#t919~0.base=|v_ULTIMATE.start_main_~#t919~0.base_30|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~x~0=v_~x~0_153, ULTIMATE.start_main_~#t920~0.offset=|v_ULTIMATE.start_main_~#t920~0.offset_17|, ULTIMATE.start_main_~#t921~0.base=|v_ULTIMATE.start_main_~#t921~0.base_15|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_~#t919~0.offset, ULTIMATE.start_main_~#t921~0.offset, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t920~0.base, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t919~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t920~0.offset, ULTIMATE.start_main_~#t921~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 13:19:46,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1407492100)) (= 1 ~a$r_buff0_thd1~0_Out-1407492100) (= ~a$r_buff0_thd0~0_In-1407492100 ~a$r_buff1_thd0~0_Out-1407492100) (= ~a$r_buff1_thd2~0_Out-1407492100 ~a$r_buff0_thd2~0_In-1407492100) (= ~a$r_buff0_thd1~0_In-1407492100 ~a$r_buff1_thd1~0_Out-1407492100) (= ~a$r_buff1_thd3~0_Out-1407492100 ~a$r_buff0_thd3~0_In-1407492100) (= ~x~0_In-1407492100 ~__unbuffered_p0_EAX~0_Out-1407492100)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1407492100, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1407492100, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1407492100, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1407492100, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1407492100, ~x~0=~x~0_In-1407492100} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1407492100, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1407492100, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1407492100, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1407492100, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1407492100, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1407492100, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1407492100, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1407492100, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1407492100, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1407492100, ~x~0=~x~0_In-1407492100} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:19:46,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t920~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t920~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t920~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t920~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t920~0.base_11|) |v_ULTIMATE.start_main_~#t920~0.offset_10| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t920~0.offset_10|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t920~0.base_11| 1)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t920~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t920~0.base=|v_ULTIMATE.start_main_~#t920~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t920~0.offset=|v_ULTIMATE.start_main_~#t920~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t920~0.base, #length, ULTIMATE.start_main_~#t920~0.offset] because there is no mapped edge [2019-12-18 13:19:46,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t921~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t921~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t921~0.base_11| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t921~0.base_11| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t921~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t921~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t921~0.base_11|) |v_ULTIMATE.start_main_~#t921~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t921~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t921~0.base=|v_ULTIMATE.start_main_~#t921~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t921~0.offset=|v_ULTIMATE.start_main_~#t921~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t921~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t921~0.offset] because there is no mapped edge [2019-12-18 13:19:46,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In2056532424 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In2056532424 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out2056532424| ~a~0_In2056532424) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out2056532424| ~a$w_buff1~0_In2056532424) (not .cse1)))) InVars {~a~0=~a~0_In2056532424, ~a$w_buff1~0=~a$w_buff1~0_In2056532424, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2056532424, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2056532424} OutVars{~a~0=~a~0_In2056532424, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out2056532424|, ~a$w_buff1~0=~a$w_buff1~0_In2056532424, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2056532424, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2056532424} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 13:19:46,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_30| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_30|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_29|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_43|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 13:19:46,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-642788930 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-642788930 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-642788930| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-642788930| ~a$w_buff0_used~0_In-642788930)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-642788930, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-642788930} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-642788930, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-642788930, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-642788930|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:19:46,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd2~0_In-1425242325 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1425242325 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1425242325 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1425242325 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1425242325| ~a$w_buff1_used~0_In-1425242325) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1425242325| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1425242325, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1425242325, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1425242325, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1425242325} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1425242325, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1425242325, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1425242325, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1425242325|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1425242325} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 13:19:46,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In204575494 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In204575494 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out204575494| ~a$r_buff0_thd2~0_In204575494) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out204575494|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In204575494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In204575494} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In204575494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In204575494, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out204575494|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 13:19:46,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd2~0_In344470834 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In344470834 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In344470834 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In344470834 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In344470834 |P1Thread1of1ForFork2_#t~ite14_Out344470834|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out344470834|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In344470834, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In344470834, ~a$w_buff0_used~0=~a$w_buff0_used~0_In344470834, ~a$w_buff1_used~0=~a$w_buff1_used~0_In344470834} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In344470834, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In344470834, ~a$w_buff0_used~0=~a$w_buff0_used~0_In344470834, ~a$w_buff1_used~0=~a$w_buff1_used~0_In344470834, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out344470834|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 13:19:46,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:19:46,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In273769040 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In273769040 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out273769040|)) (and (= ~a$w_buff0_used~0_In273769040 |P0Thread1of1ForFork1_#t~ite5_Out273769040|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In273769040, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In273769040} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out273769040|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In273769040, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In273769040} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 13:19:46,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1256804222 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1256804222 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1256804222 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-1256804222 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1256804222|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out-1256804222| ~a$w_buff1_used~0_In-1256804222)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1256804222, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1256804222, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1256804222, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1256804222} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1256804222|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1256804222, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1256804222, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1256804222, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1256804222} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 13:19:46,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In736979810 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In736979810 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In736979810 ~a$r_buff0_thd1~0_Out736979810)) (and (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out736979810) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In736979810, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In736979810} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out736979810|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In736979810, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out736979810} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:19:46,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-1460961459 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1460961459 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1460961459 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1460961459 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1460961459| ~a$r_buff1_thd1~0_In-1460961459) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1460961459|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1460961459, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1460961459, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1460961459, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1460961459} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1460961459|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1460961459, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1460961459, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1460961459, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1460961459} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:19:46,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_37|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:19:46,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In663134038 256)))) (or (and (= ~a$w_buff1_used~0_In663134038 |P2Thread1of1ForFork0_#t~ite30_Out663134038|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In663134038| |P2Thread1of1ForFork0_#t~ite29_Out663134038|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite30_Out663134038| |P2Thread1of1ForFork0_#t~ite29_Out663134038|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In663134038 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In663134038 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In663134038 256) 0)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In663134038 256))))) (= ~a$w_buff1_used~0_In663134038 |P2Thread1of1ForFork0_#t~ite29_Out663134038|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In663134038, ~a$w_buff0_used~0=~a$w_buff0_used~0_In663134038, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In663134038, ~a$w_buff1_used~0=~a$w_buff1_used~0_In663134038, ~weak$$choice2~0=~weak$$choice2~0_In663134038, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In663134038|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In663134038, ~a$w_buff0_used~0=~a$w_buff0_used~0_In663134038, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In663134038, ~a$w_buff1_used~0=~a$w_buff1_used~0_In663134038, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out663134038|, ~weak$$choice2~0=~weak$$choice2~0_In663134038, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out663134038|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 13:19:46,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 13:19:46,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 13:19:46,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In224748934 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In224748934 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out224748934| ~a$w_buff1~0_In224748934)) (and (or .cse1 .cse0) (= ~a~0_In224748934 |P2Thread1of1ForFork0_#t~ite38_Out224748934|)))) InVars {~a~0=~a~0_In224748934, ~a$w_buff1~0=~a$w_buff1~0_In224748934, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In224748934, ~a$w_buff1_used~0=~a$w_buff1_used~0_In224748934} OutVars{~a~0=~a~0_In224748934, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out224748934|, ~a$w_buff1~0=~a$w_buff1~0_In224748934, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In224748934, ~a$w_buff1_used~0=~a$w_buff1_used~0_In224748934} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:19:46,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 13:19:46,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1569547599 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1569547599 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1569547599| ~a$w_buff0_used~0_In1569547599)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1569547599| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1569547599, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1569547599} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1569547599|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1569547599, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1569547599} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 13:19:46,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-1496072878 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1496072878 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1496072878 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-1496072878 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1496072878| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out-1496072878| ~a$w_buff1_used~0_In-1496072878) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1496072878, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1496072878, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1496072878, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1496072878} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1496072878, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1496072878, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1496072878, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1496072878, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1496072878|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 13:19:46,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In671887682 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In671887682 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out671887682| ~a$r_buff0_thd3~0_In671887682)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out671887682| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In671887682, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In671887682} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In671887682, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In671887682, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out671887682|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 13:19:46,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-576333922 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-576333922 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In-576333922 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-576333922 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-576333922| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In-576333922 |P2Thread1of1ForFork0_#t~ite43_Out-576333922|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-576333922, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-576333922, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-576333922, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-576333922} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-576333922|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-576333922, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-576333922, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-576333922, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-576333922} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 13:19:46,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 13:19:46,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: 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:19:46,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-2144592261| |ULTIMATE.start_main_#t~ite47_Out-2144592261|)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-2144592261 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-2144592261 256) 0))) (or (and .cse0 (not .cse1) (= ~a$w_buff1~0_In-2144592261 |ULTIMATE.start_main_#t~ite47_Out-2144592261|) (not .cse2)) (and (= ~a~0_In-2144592261 |ULTIMATE.start_main_#t~ite47_Out-2144592261|) .cse0 (or .cse1 .cse2)))) InVars {~a~0=~a~0_In-2144592261, ~a$w_buff1~0=~a$w_buff1~0_In-2144592261, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2144592261, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2144592261} OutVars{~a~0=~a~0_In-2144592261, ~a$w_buff1~0=~a$w_buff1~0_In-2144592261, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2144592261|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2144592261, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2144592261|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2144592261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:19:46,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1699700670 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1699700670 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1699700670| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1699700670| ~a$w_buff0_used~0_In-1699700670)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1699700670, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1699700670} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1699700670, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1699700670|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1699700670} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:19:46,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-2045580141 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-2045580141 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-2045580141 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2045580141 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-2045580141 |ULTIMATE.start_main_#t~ite50_Out-2045580141|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-2045580141| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2045580141, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2045580141, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2045580141, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2045580141} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2045580141|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2045580141, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2045580141, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2045580141, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2045580141} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:19:46,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1285943204 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1285943204 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1285943204| ~a$r_buff0_thd0~0_In-1285943204)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1285943204| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1285943204, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1285943204} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1285943204|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1285943204, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1285943204} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:19:46,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1308694173 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-1308694173 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1308694173 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1308694173 256) 0))) (or (and (= ~a$r_buff1_thd0~0_In-1308694173 |ULTIMATE.start_main_#t~ite52_Out-1308694173|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1308694173|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1308694173, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1308694173, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1308694173, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1308694173} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1308694173|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1308694173, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1308694173, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1308694173, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1308694173} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:19:46,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~main$tmp_guard1~0_17 0) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= 0 v_~__unbuffered_p0_EAX~0_128)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:19:46,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:19:46 BasicIcfg [2019-12-18 13:19:46,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:19:46,270 INFO L168 Benchmark]: Toolchain (without parser) took 89624.13 ms. Allocated memory was 145.8 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.6 MB in the beginning and 957.9 MB in the end (delta: -857.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 13:19:46,271 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 13:19:46,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.47 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 156.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:19:46,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.19 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:19:46,272 INFO L168 Benchmark]: Boogie Preprocessor took 37.53 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.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:19:46,273 INFO L168 Benchmark]: RCFGBuilder took 836.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.3 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:19:46,274 INFO L168 Benchmark]: TraceAbstraction took 87886.37 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.3 MB in the beginning and 957.9 MB in the end (delta: -857.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 13:19:46,277 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.47 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 156.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.19 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.53 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.3 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87886.37 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.3 MB in the beginning and 957.9 MB in the end (delta: -857.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t919, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t920, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t921, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 87.5s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5301 SDtfs, 5052 SDslu, 13485 SDs, 0 SdLazy, 4937 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 34 SyntacticMatches, 15 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155174occurred 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: 34.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 184051 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 137681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...