/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/safe026_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:00:21,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:00:21,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:00:21,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:00:21,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:00:21,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:00:21,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:00:21,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:00:21,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:00:21,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:00:21,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:00:21,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:00:21,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:00:21,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:00:21,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:00:21,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:00:21,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:00:21,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:00:21,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:00:21,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:00:21,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:00:21,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:00:21,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:00:21,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:00:21,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:00:21,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:00:21,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:00:21,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:00:21,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:00:21,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:00:21,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:00:21,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:00:21,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:00:21,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:00:21,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:00:21,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:00:21,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:00:21,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:00:21,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:00:21,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:00:21,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:00:21,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:00:21,533 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:00:21,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:00:21,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:00:21,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:00:21,535 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:00:21,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:00:21,535 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:00:21,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:00:21,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:00:21,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:00:21,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:00:21,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:00:21,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:00:21,536 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:00:21,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:00:21,537 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:00:21,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:00:21,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:00:21,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:00:21,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:00:21,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:00:21,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:00:21,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:00:21,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:00:21,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:00:21,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:00:21,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:00:21,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:00:21,539 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:00:21,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:00:21,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:00:21,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:00:21,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:00:21,853 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:00:21,853 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:00:21,854 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc.i [2019-12-18 15:00:21,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65647a988/ffb2610855d640278df184cec70a45ff/FLAG35c48437b [2019-12-18 15:00:22,469 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:00:22,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc.i [2019-12-18 15:00:22,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65647a988/ffb2610855d640278df184cec70a45ff/FLAG35c48437b [2019-12-18 15:00:22,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65647a988/ffb2610855d640278df184cec70a45ff [2019-12-18 15:00:22,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:00:22,749 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:00:22,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:00:22,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:00:22,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:00:22,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:00:22" (1/1) ... [2019-12-18 15:00:22,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:22, skipping insertion in model container [2019-12-18 15:00:22,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:00:22" (1/1) ... [2019-12-18 15:00:22,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:00:22,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:00:23,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:00:23,365 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:00:23,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:00:23,509 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:00:23,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23 WrapperNode [2019-12-18 15:00:23,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:00:23,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:00:23,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:00:23,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:00:23,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23" (1/1) ... [2019-12-18 15:00:23,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23" (1/1) ... [2019-12-18 15:00:23,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:00:23,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:00:23,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:00:23,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:00:23,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23" (1/1) ... [2019-12-18 15:00:23,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23" (1/1) ... [2019-12-18 15:00:23,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23" (1/1) ... [2019-12-18 15:00:23,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23" (1/1) ... [2019-12-18 15:00:23,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23" (1/1) ... [2019-12-18 15:00:23,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23" (1/1) ... [2019-12-18 15:00:23,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23" (1/1) ... [2019-12-18 15:00:23,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:00:23,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:00:23,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:00:23,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:00:23,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:00:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:00:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:00:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:00:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:00:23,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:00:23,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:00:23,693 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:00:23,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:00:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:00:23,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:00:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:00:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:00:23,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:00:23,697 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:00:24,530 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:00:24,531 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:00:24,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:00:24 BoogieIcfgContainer [2019-12-18 15:00:24,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:00:24,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:00:24,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:00:24,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:00:24,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:00:22" (1/3) ... [2019-12-18 15:00:24,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3f891e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:00:24, skipping insertion in model container [2019-12-18 15:00:24,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:23" (2/3) ... [2019-12-18 15:00:24,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3f891e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:00:24, skipping insertion in model container [2019-12-18 15:00:24,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:00:24" (3/3) ... [2019-12-18 15:00:24,540 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc.i [2019-12-18 15:00:24,549 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:00:24,550 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:00:24,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:00:24,558 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:00:24,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,604 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,606 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,606 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,651 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,652 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,707 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,708 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,712 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,714 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:24,732 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:00:24,753 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:00:24,753 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:00:24,753 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:00:24,753 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:00:24,754 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:00:24,754 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:00:24,754 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:00:24,754 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:00:24,771 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 15:00:24,773 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 15:00:24,862 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 15:00:24,862 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:00:24,882 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 15:00:24,910 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 15:00:24,957 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 15:00:24,957 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:00:24,966 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 15:00:24,988 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 15:00:24,989 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:00:25,678 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-18 15:00:30,332 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 15:00:30,456 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 15:00:30,482 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-18 15:00:30,483 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 15:00:30,486 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-18 15:00:47,169 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-18 15:00:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-18 15:00:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:00:47,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:47,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:00:47,178 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 15:00:47,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:47,183 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-18 15:00:47,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:47,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508160658] [2019-12-18 15:00:47,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:00:47,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508160658] [2019-12-18 15:00:47,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:47,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:00:47,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715066399] [2019-12-18 15:00:47,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:00:47,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:47,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:00:47,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:00:47,523 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-18 15:00:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:51,304 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-18 15:00:51,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:00:51,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:00:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:52,017 INFO L225 Difference]: With dead ends: 108680 [2019-12-18 15:00:52,017 INFO L226 Difference]: Without dead ends: 102440 [2019-12-18 15:00:52,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:00:56,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-18 15:00:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-18 15:00:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-18 15:01:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-18 15:01:02,951 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-18 15:01:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:01:02,951 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-18 15:01:02,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:01:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-18 15:01:02,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:01:02,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:01:02,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:01:02,956 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 15:01:02,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:01:02,956 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-18 15:01:02,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:01:02,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386905169] [2019-12-18 15:01:02,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:01:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:01:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:01:03,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386905169] [2019-12-18 15:01:03,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:01:03,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:01:03,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779830912] [2019-12-18 15:01:03,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:01:03,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:01:03,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:01:03,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:01:03,042 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-18 15:01:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:01:08,277 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-18 15:01:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:01:08,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 15:01:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:01:08,893 INFO L225 Difference]: With dead ends: 163248 [2019-12-18 15:01:08,893 INFO L226 Difference]: Without dead ends: 163199 [2019-12-18 15:01:08,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:01:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-18 15:01:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-18 15:01:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-18 15:01:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-18 15:01:17,667 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-18 15:01:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:01:17,667 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-18 15:01:17,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:01:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-18 15:01:17,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:01:17,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:01:17,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:01:17,674 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 15:01:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:01:17,675 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-18 15:01:17,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:01:17,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396479773] [2019-12-18 15:01:17,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:01:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:01:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:01:17,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396479773] [2019-12-18 15:01:17,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:01:17,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:01:17,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210750368] [2019-12-18 15:01:17,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:01:17,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:01:17,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:01:17,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:01:17,754 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-18 15:01:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:01:24,001 INFO L93 Difference]: Finished difference Result 208779 states and 842772 transitions. [2019-12-18 15:01:24,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:01:24,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:01:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:01:25,441 INFO L225 Difference]: With dead ends: 208779 [2019-12-18 15:01:25,441 INFO L226 Difference]: Without dead ends: 208723 [2019-12-18 15:01:25,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:01:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208723 states. [2019-12-18 15:01:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208723 to 175996. [2019-12-18 15:01:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175996 states. [2019-12-18 15:01:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175996 states to 175996 states and 723083 transitions. [2019-12-18 15:01:35,557 INFO L78 Accepts]: Start accepts. Automaton has 175996 states and 723083 transitions. Word has length 13 [2019-12-18 15:01:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:01:35,558 INFO L462 AbstractCegarLoop]: Abstraction has 175996 states and 723083 transitions. [2019-12-18 15:01:35,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:01:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 175996 states and 723083 transitions. [2019-12-18 15:01:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 15:01:35,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:01:35,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:01:35,568 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 15:01:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:01:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-18 15:01:35,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:01:35,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432858610] [2019-12-18 15:01:35,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:01:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:01:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:01:35,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432858610] [2019-12-18 15:01:35,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:01:35,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:01:35,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190939262] [2019-12-18 15:01:35,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:01:35,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:01:35,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:01:35,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:01:35,656 INFO L87 Difference]: Start difference. First operand 175996 states and 723083 transitions. Second operand 5 states. [2019-12-18 15:01:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:01:43,192 INFO L93 Difference]: Finished difference Result 234922 states and 955485 transitions. [2019-12-18 15:01:43,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:01:43,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 15:01:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:01:43,893 INFO L225 Difference]: With dead ends: 234922 [2019-12-18 15:01:43,893 INFO L226 Difference]: Without dead ends: 234922 [2019-12-18 15:01:43,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:01:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234922 states. [2019-12-18 15:01:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234922 to 195490. [2019-12-18 15:01:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195490 states. [2019-12-18 15:01:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195490 states to 195490 states and 801473 transitions. [2019-12-18 15:01:58,862 INFO L78 Accepts]: Start accepts. Automaton has 195490 states and 801473 transitions. Word has length 16 [2019-12-18 15:01:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:01:58,862 INFO L462 AbstractCegarLoop]: Abstraction has 195490 states and 801473 transitions. [2019-12-18 15:01:58,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:01:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 195490 states and 801473 transitions. [2019-12-18 15:01:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:01:58,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:01:58,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:01:58,880 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 15:01:58,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:01:58,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1153162558, now seen corresponding path program 1 times [2019-12-18 15:01:58,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:01:58,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312686622] [2019-12-18 15:01:58,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:01:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:01:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:01:58,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312686622] [2019-12-18 15:01:58,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:01:58,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:01:58,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089667946] [2019-12-18 15:01:58,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:01:58,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:01:58,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:01:58,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:01:58,947 INFO L87 Difference]: Start difference. First operand 195490 states and 801473 transitions. Second operand 3 states. [2019-12-18 15:02:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:06,251 INFO L93 Difference]: Finished difference Result 195126 states and 800046 transitions. [2019-12-18 15:02:06,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:02:06,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 15:02:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:06,832 INFO L225 Difference]: With dead ends: 195126 [2019-12-18 15:02:06,832 INFO L226 Difference]: Without dead ends: 195126 [2019-12-18 15:02:06,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:02:12,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195126 states. [2019-12-18 15:02:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195126 to 195126. [2019-12-18 15:02:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195126 states. [2019-12-18 15:02:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195126 states to 195126 states and 800046 transitions. [2019-12-18 15:02:15,991 INFO L78 Accepts]: Start accepts. Automaton has 195126 states and 800046 transitions. Word has length 18 [2019-12-18 15:02:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:15,991 INFO L462 AbstractCegarLoop]: Abstraction has 195126 states and 800046 transitions. [2019-12-18 15:02:15,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:02:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 195126 states and 800046 transitions. [2019-12-18 15:02:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:02:16,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:16,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:02:16,011 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 15:02:16,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:16,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1951188865, now seen corresponding path program 1 times [2019-12-18 15:02:16,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:16,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575976887] [2019-12-18 15:02:16,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:16,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575976887] [2019-12-18 15:02:16,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:16,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:02:16,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228304964] [2019-12-18 15:02:16,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:02:16,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:16,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:02:16,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:02:16,095 INFO L87 Difference]: Start difference. First operand 195126 states and 800046 transitions. Second operand 4 states. [2019-12-18 15:02:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:23,918 INFO L93 Difference]: Finished difference Result 367409 states and 1507754 transitions. [2019-12-18 15:02:23,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:02:23,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 15:02:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:24,596 INFO L225 Difference]: With dead ends: 367409 [2019-12-18 15:02:24,597 INFO L226 Difference]: Without dead ends: 208324 [2019-12-18 15:02:24,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:02:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208324 states. [2019-12-18 15:02:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208324 to 206903. [2019-12-18 15:02:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206903 states. [2019-12-18 15:02:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206903 states to 206903 states and 837795 transitions. [2019-12-18 15:02:40,768 INFO L78 Accepts]: Start accepts. Automaton has 206903 states and 837795 transitions. Word has length 19 [2019-12-18 15:02:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:40,768 INFO L462 AbstractCegarLoop]: Abstraction has 206903 states and 837795 transitions. [2019-12-18 15:02:40,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:02:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 206903 states and 837795 transitions. [2019-12-18 15:02:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:02:40,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:40,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:02:40,787 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 15:02:40,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:40,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2060703810, now seen corresponding path program 1 times [2019-12-18 15:02:40,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:40,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764778183] [2019-12-18 15:02:40,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:40,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764778183] [2019-12-18 15:02:40,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:40,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:02:40,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510071907] [2019-12-18 15:02:40,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:02:40,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:40,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:02:40,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:02:40,869 INFO L87 Difference]: Start difference. First operand 206903 states and 837795 transitions. Second operand 4 states. [2019-12-18 15:02:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:41,161 INFO L93 Difference]: Finished difference Result 53084 states and 178612 transitions. [2019-12-18 15:02:41,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:02:41,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 15:02:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:41,234 INFO L225 Difference]: With dead ends: 53084 [2019-12-18 15:02:41,235 INFO L226 Difference]: Without dead ends: 41205 [2019-12-18 15:02:41,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:02:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41205 states. [2019-12-18 15:02:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41205 to 40210. [2019-12-18 15:02:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40210 states. [2019-12-18 15:02:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40210 states to 40210 states and 128989 transitions. [2019-12-18 15:02:41,902 INFO L78 Accepts]: Start accepts. Automaton has 40210 states and 128989 transitions. Word has length 19 [2019-12-18 15:02:41,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:41,903 INFO L462 AbstractCegarLoop]: Abstraction has 40210 states and 128989 transitions. [2019-12-18 15:02:41,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:02:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 40210 states and 128989 transitions. [2019-12-18 15:02:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:02:41,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:41,909 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 15:02:41,909 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 15:02:41,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:41,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-18 15:02:41,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:41,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498034187] [2019-12-18 15:02:41,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:42,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498034187] [2019-12-18 15:02:42,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:42,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:02:42,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964798079] [2019-12-18 15:02:42,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:02:42,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:42,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:02:42,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:02:42,045 INFO L87 Difference]: Start difference. First operand 40210 states and 128989 transitions. Second operand 6 states. [2019-12-18 15:02:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:45,578 INFO L93 Difference]: Finished difference Result 60602 states and 188612 transitions. [2019-12-18 15:02:45,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:02:45,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 15:02:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:45,679 INFO L225 Difference]: With dead ends: 60602 [2019-12-18 15:02:45,679 INFO L226 Difference]: Without dead ends: 60504 [2019-12-18 15:02:45,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:02:45,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60504 states. [2019-12-18 15:02:46,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60504 to 40348. [2019-12-18 15:02:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40348 states. [2019-12-18 15:02:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40348 states to 40348 states and 128423 transitions. [2019-12-18 15:02:46,454 INFO L78 Accepts]: Start accepts. Automaton has 40348 states and 128423 transitions. Word has length 22 [2019-12-18 15:02:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:46,454 INFO L462 AbstractCegarLoop]: Abstraction has 40348 states and 128423 transitions. [2019-12-18 15:02:46,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:02:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 40348 states and 128423 transitions. [2019-12-18 15:02:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:02:46,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:46,464 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 15:02:46,465 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 15:02:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:46,465 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-18 15:02:46,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:46,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598308713] [2019-12-18 15:02:46,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:46,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598308713] [2019-12-18 15:02:46,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:46,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:02:46,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704827092] [2019-12-18 15:02:46,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:02:46,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:02:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:02:46,546 INFO L87 Difference]: Start difference. First operand 40348 states and 128423 transitions. Second operand 5 states. [2019-12-18 15:02:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:47,113 INFO L93 Difference]: Finished difference Result 56186 states and 174944 transitions. [2019-12-18 15:02:47,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:02:47,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 15:02:47,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:47,205 INFO L225 Difference]: With dead ends: 56186 [2019-12-18 15:02:47,205 INFO L226 Difference]: Without dead ends: 55974 [2019-12-18 15:02:47,205 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 15:02:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55974 states. [2019-12-18 15:02:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55974 to 47425. [2019-12-18 15:02:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47425 states. [2019-12-18 15:02:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47425 states to 47425 states and 150377 transitions. [2019-12-18 15:02:48,374 INFO L78 Accepts]: Start accepts. Automaton has 47425 states and 150377 transitions. Word has length 25 [2019-12-18 15:02:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:48,374 INFO L462 AbstractCegarLoop]: Abstraction has 47425 states and 150377 transitions. [2019-12-18 15:02:48,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:02:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 47425 states and 150377 transitions. [2019-12-18 15:02:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:02:48,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:48,388 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 15:02:48,388 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 15:02:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:48,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-18 15:02:48,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:48,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279504326] [2019-12-18 15:02:48,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:48,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279504326] [2019-12-18 15:02:48,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:48,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:02:48,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401293807] [2019-12-18 15:02:48,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:02:48,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:48,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:02:48,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:02:48,469 INFO L87 Difference]: Start difference. First operand 47425 states and 150377 transitions. Second operand 6 states. [2019-12-18 15:02:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:49,160 INFO L93 Difference]: Finished difference Result 66982 states and 207084 transitions. [2019-12-18 15:02:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:02:49,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 15:02:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:49,268 INFO L225 Difference]: With dead ends: 66982 [2019-12-18 15:02:49,268 INFO L226 Difference]: Without dead ends: 66389 [2019-12-18 15:02:49,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:02:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66389 states. [2019-12-18 15:02:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66389 to 52066. [2019-12-18 15:02:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52066 states. [2019-12-18 15:02:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52066 states to 52066 states and 164051 transitions. [2019-12-18 15:02:50,583 INFO L78 Accepts]: Start accepts. Automaton has 52066 states and 164051 transitions. Word has length 27 [2019-12-18 15:02:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:50,583 INFO L462 AbstractCegarLoop]: Abstraction has 52066 states and 164051 transitions. [2019-12-18 15:02:50,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:02:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 52066 states and 164051 transitions. [2019-12-18 15:02:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 15:02:50,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:50,602 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 15:02:50,602 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 15:02:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:50,603 INFO L82 PathProgramCache]: Analyzing trace with hash -524022794, now seen corresponding path program 1 times [2019-12-18 15:02:50,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:50,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290855011] [2019-12-18 15:02:50,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:50,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290855011] [2019-12-18 15:02:50,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:50,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:02:50,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848565508] [2019-12-18 15:02:50,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:02:50,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:50,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:02:50,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:02:50,663 INFO L87 Difference]: Start difference. First operand 52066 states and 164051 transitions. Second operand 4 states. [2019-12-18 15:02:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:51,036 INFO L93 Difference]: Finished difference Result 118270 states and 380880 transitions. [2019-12-18 15:02:51,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:02:51,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-18 15:02:51,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:51,080 INFO L225 Difference]: With dead ends: 118270 [2019-12-18 15:02:51,081 INFO L226 Difference]: Without dead ends: 28049 [2019-12-18 15:02:51,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:02:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28049 states. [2019-12-18 15:02:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28049 to 27357. [2019-12-18 15:02:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27357 states. [2019-12-18 15:02:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27357 states to 27357 states and 84690 transitions. [2019-12-18 15:02:51,933 INFO L78 Accepts]: Start accepts. Automaton has 27357 states and 84690 transitions. Word has length 29 [2019-12-18 15:02:51,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:51,934 INFO L462 AbstractCegarLoop]: Abstraction has 27357 states and 84690 transitions. [2019-12-18 15:02:51,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:02:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 27357 states and 84690 transitions. [2019-12-18 15:02:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:02:51,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:51,947 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] [2019-12-18 15:02:51,947 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 15:02:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:51,948 INFO L82 PathProgramCache]: Analyzing trace with hash -116284186, now seen corresponding path program 1 times [2019-12-18 15:02:51,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:51,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105294539] [2019-12-18 15:02:51,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:52,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105294539] [2019-12-18 15:02:52,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:52,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:02:52,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089556573] [2019-12-18 15:02:52,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:02:52,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:52,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:02:52,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:02:52,040 INFO L87 Difference]: Start difference. First operand 27357 states and 84690 transitions. Second operand 5 states. [2019-12-18 15:02:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:52,736 INFO L93 Difference]: Finished difference Result 41160 states and 127027 transitions. [2019-12-18 15:02:52,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:02:52,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 15:02:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:52,798 INFO L225 Difference]: With dead ends: 41160 [2019-12-18 15:02:52,798 INFO L226 Difference]: Without dead ends: 41160 [2019-12-18 15:02:52,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:02:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41160 states. [2019-12-18 15:02:53,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41160 to 36991. [2019-12-18 15:02:53,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36991 states. [2019-12-18 15:02:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36991 states to 36991 states and 114873 transitions. [2019-12-18 15:02:53,400 INFO L78 Accepts]: Start accepts. Automaton has 36991 states and 114873 transitions. Word has length 30 [2019-12-18 15:02:53,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:53,400 INFO L462 AbstractCegarLoop]: Abstraction has 36991 states and 114873 transitions. [2019-12-18 15:02:53,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:02:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 36991 states and 114873 transitions. [2019-12-18 15:02:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:02:53,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:53,417 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] [2019-12-18 15:02:53,418 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 15:02:53,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1132903455, now seen corresponding path program 1 times [2019-12-18 15:02:53,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:53,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700856893] [2019-12-18 15:02:53,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:53,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700856893] [2019-12-18 15:02:53,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:53,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:02:53,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238829030] [2019-12-18 15:02:53,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:02:53,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:53,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:02:53,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:02:53,505 INFO L87 Difference]: Start difference. First operand 36991 states and 114873 transitions. Second operand 5 states. [2019-12-18 15:02:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:54,638 INFO L93 Difference]: Finished difference Result 53889 states and 165459 transitions. [2019-12-18 15:02:54,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:02:54,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 15:02:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:54,753 INFO L225 Difference]: With dead ends: 53889 [2019-12-18 15:02:54,753 INFO L226 Difference]: Without dead ends: 53840 [2019-12-18 15:02:54,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:02:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53840 states. [2019-12-18 15:02:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53840 to 44806. [2019-12-18 15:02:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44806 states. [2019-12-18 15:02:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44806 states to 44806 states and 139518 transitions. [2019-12-18 15:02:55,538 INFO L78 Accepts]: Start accepts. Automaton has 44806 states and 139518 transitions. Word has length 30 [2019-12-18 15:02:55,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:55,539 INFO L462 AbstractCegarLoop]: Abstraction has 44806 states and 139518 transitions. [2019-12-18 15:02:55,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:02:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 44806 states and 139518 transitions. [2019-12-18 15:02:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 15:02:55,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:55,561 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] [2019-12-18 15:02:55,561 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 15:02:55,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:55,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1026319235, now seen corresponding path program 1 times [2019-12-18 15:02:55,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:55,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242194377] [2019-12-18 15:02:55,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:55,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242194377] [2019-12-18 15:02:55,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:55,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:02:55,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952650980] [2019-12-18 15:02:55,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:02:55,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:55,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:02:55,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:02:55,669 INFO L87 Difference]: Start difference. First operand 44806 states and 139518 transitions. Second operand 5 states. [2019-12-18 15:02:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:55,794 INFO L93 Difference]: Finished difference Result 21943 states and 64706 transitions. [2019-12-18 15:02:55,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:02:55,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-18 15:02:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:55,821 INFO L225 Difference]: With dead ends: 21943 [2019-12-18 15:02:55,821 INFO L226 Difference]: Without dead ends: 19299 [2019-12-18 15:02:55,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:02:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19299 states. [2019-12-18 15:02:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19299 to 18143. [2019-12-18 15:02:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18143 states. [2019-12-18 15:02:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18143 states to 18143 states and 53716 transitions. [2019-12-18 15:02:56,083 INFO L78 Accepts]: Start accepts. Automaton has 18143 states and 53716 transitions. Word has length 31 [2019-12-18 15:02:56,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:56,084 INFO L462 AbstractCegarLoop]: Abstraction has 18143 states and 53716 transitions. [2019-12-18 15:02:56,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:02:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 18143 states and 53716 transitions. [2019-12-18 15:02:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 15:02:56,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:56,359 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 15:02:56,359 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 15:02:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:56,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-18 15:02:56,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:56,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628343524] [2019-12-18 15:02:56,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:56,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628343524] [2019-12-18 15:02:56,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:56,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:02:56,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078484250] [2019-12-18 15:02:56,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:02:56,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:02:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:02:56,456 INFO L87 Difference]: Start difference. First operand 18143 states and 53716 transitions. Second operand 7 states. [2019-12-18 15:02:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:57,261 INFO L93 Difference]: Finished difference Result 19608 states and 56880 transitions. [2019-12-18 15:02:57,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:02:57,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 15:02:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:57,294 INFO L225 Difference]: With dead ends: 19608 [2019-12-18 15:02:57,295 INFO L226 Difference]: Without dead ends: 18921 [2019-12-18 15:02:57,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:02:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18921 states. [2019-12-18 15:02:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18921 to 17152. [2019-12-18 15:02:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17152 states. [2019-12-18 15:02:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17152 states to 17152 states and 50369 transitions. [2019-12-18 15:02:57,542 INFO L78 Accepts]: Start accepts. Automaton has 17152 states and 50369 transitions. Word has length 33 [2019-12-18 15:02:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:57,542 INFO L462 AbstractCegarLoop]: Abstraction has 17152 states and 50369 transitions. [2019-12-18 15:02:57,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:02:57,543 INFO L276 IsEmpty]: Start isEmpty. Operand 17152 states and 50369 transitions. [2019-12-18 15:02:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 15:02:57,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:57,565 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 15:02:57,565 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 15:02:57,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:57,566 INFO L82 PathProgramCache]: Analyzing trace with hash -739159160, now seen corresponding path program 1 times [2019-12-18 15:02:57,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:57,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409853461] [2019-12-18 15:02:57,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:57,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 15:02:57,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409853461] [2019-12-18 15:02:57,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:57,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:02:57,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252585138] [2019-12-18 15:02:57,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:02:57,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:57,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:02:57,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:02:57,666 INFO L87 Difference]: Start difference. First operand 17152 states and 50369 transitions. Second operand 6 states. [2019-12-18 15:02:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:58,538 INFO L93 Difference]: Finished difference Result 22796 states and 65727 transitions. [2019-12-18 15:02:58,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:02:58,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 15:02:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:58,578 INFO L225 Difference]: With dead ends: 22796 [2019-12-18 15:02:58,578 INFO L226 Difference]: Without dead ends: 22796 [2019-12-18 15:02:58,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:02:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22796 states. [2019-12-18 15:02:58,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22796 to 17194. [2019-12-18 15:02:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17194 states. [2019-12-18 15:02:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17194 states to 17194 states and 50488 transitions. [2019-12-18 15:02:58,866 INFO L78 Accepts]: Start accepts. Automaton has 17194 states and 50488 transitions. Word has length 40 [2019-12-18 15:02:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:58,867 INFO L462 AbstractCegarLoop]: Abstraction has 17194 states and 50488 transitions. [2019-12-18 15:02:58,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:02:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 17194 states and 50488 transitions. [2019-12-18 15:02:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 15:02:58,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:58,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, 1, 1, 1, 1, 1] [2019-12-18 15:02:58,888 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 15:02:58,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:58,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1031083350, now seen corresponding path program 2 times [2019-12-18 15:02:58,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:58,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763700939] [2019-12-18 15:02:58,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:58,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763700939] [2019-12-18 15:02:58,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:58,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:02:58,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490522364] [2019-12-18 15:02:58,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:02:58,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:58,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:02:58,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:02:58,952 INFO L87 Difference]: Start difference. First operand 17194 states and 50488 transitions. Second operand 3 states. [2019-12-18 15:02:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:59,005 INFO L93 Difference]: Finished difference Result 13828 states and 39650 transitions. [2019-12-18 15:02:59,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:02:59,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 15:02:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:59,023 INFO L225 Difference]: With dead ends: 13828 [2019-12-18 15:02:59,023 INFO L226 Difference]: Without dead ends: 13828 [2019-12-18 15:02:59,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:02:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13828 states. [2019-12-18 15:02:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13828 to 13824. [2019-12-18 15:02:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13824 states. [2019-12-18 15:02:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13824 states to 13824 states and 39642 transitions. [2019-12-18 15:02:59,209 INFO L78 Accepts]: Start accepts. Automaton has 13824 states and 39642 transitions. Word has length 40 [2019-12-18 15:02:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:59,210 INFO L462 AbstractCegarLoop]: Abstraction has 13824 states and 39642 transitions. [2019-12-18 15:02:59,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:02:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 13824 states and 39642 transitions. [2019-12-18 15:02:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 15:02:59,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:59,222 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 15:02:59,222 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 15:02:59,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:59,222 INFO L82 PathProgramCache]: Analyzing trace with hash 234062339, now seen corresponding path program 1 times [2019-12-18 15:02:59,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:59,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139740535] [2019-12-18 15:02:59,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:59,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139740535] [2019-12-18 15:02:59,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:59,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:02:59,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992057610] [2019-12-18 15:02:59,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:02:59,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:02:59,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:02:59,311 INFO L87 Difference]: Start difference. First operand 13824 states and 39642 transitions. Second operand 6 states. [2019-12-18 15:02:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:59,494 INFO L93 Difference]: Finished difference Result 12932 states and 37589 transitions. [2019-12-18 15:02:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:02:59,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 15:02:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:59,511 INFO L225 Difference]: With dead ends: 12932 [2019-12-18 15:02:59,512 INFO L226 Difference]: Without dead ends: 10536 [2019-12-18 15:02:59,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:02:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10536 states. [2019-12-18 15:02:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10536 to 10158. [2019-12-18 15:02:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10158 states. [2019-12-18 15:02:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10158 states to 10158 states and 31203 transitions. [2019-12-18 15:02:59,686 INFO L78 Accepts]: Start accepts. Automaton has 10158 states and 31203 transitions. Word has length 41 [2019-12-18 15:02:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:59,686 INFO L462 AbstractCegarLoop]: Abstraction has 10158 states and 31203 transitions. [2019-12-18 15:02:59,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:02:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 10158 states and 31203 transitions. [2019-12-18 15:02:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 15:02:59,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:59,701 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 15:02:59,702 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 15:02:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:59,702 INFO L82 PathProgramCache]: Analyzing trace with hash -805732712, now seen corresponding path program 1 times [2019-12-18 15:02:59,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:59,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326902558] [2019-12-18 15:02:59,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:59,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326902558] [2019-12-18 15:02:59,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:59,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:02:59,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246366213] [2019-12-18 15:02:59,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:02:59,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:59,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:02:59,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:02:59,742 INFO L87 Difference]: Start difference. First operand 10158 states and 31203 transitions. Second operand 3 states. [2019-12-18 15:02:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:59,841 INFO L93 Difference]: Finished difference Result 15542 states and 47698 transitions. [2019-12-18 15:02:59,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:02:59,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 15:02:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:59,869 INFO L225 Difference]: With dead ends: 15542 [2019-12-18 15:02:59,869 INFO L226 Difference]: Without dead ends: 15542 [2019-12-18 15:02:59,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:02:59,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15542 states. [2019-12-18 15:03:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15542 to 12102. [2019-12-18 15:03:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12102 states. [2019-12-18 15:03:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12102 states to 12102 states and 37639 transitions. [2019-12-18 15:03:00,085 INFO L78 Accepts]: Start accepts. Automaton has 12102 states and 37639 transitions. Word has length 65 [2019-12-18 15:03:00,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:00,085 INFO L462 AbstractCegarLoop]: Abstraction has 12102 states and 37639 transitions. [2019-12-18 15:03:00,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:03:00,085 INFO L276 IsEmpty]: Start isEmpty. Operand 12102 states and 37639 transitions. [2019-12-18 15:03:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 15:03:00,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:00,097 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 15:03:00,097 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 15:03:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash -517089773, now seen corresponding path program 1 times [2019-12-18 15:03:00,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:00,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974288953] [2019-12-18 15:03:00,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:00,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974288953] [2019-12-18 15:03:00,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:00,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:03:00,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570280719] [2019-12-18 15:03:00,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:03:00,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:00,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:03:00,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:03:00,140 INFO L87 Difference]: Start difference. First operand 12102 states and 37639 transitions. Second operand 3 states. [2019-12-18 15:03:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:00,230 INFO L93 Difference]: Finished difference Result 15542 states and 46336 transitions. [2019-12-18 15:03:00,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:03:00,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 15:03:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:00,250 INFO L225 Difference]: With dead ends: 15542 [2019-12-18 15:03:00,250 INFO L226 Difference]: Without dead ends: 15542 [2019-12-18 15:03:00,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:03:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15542 states. [2019-12-18 15:03:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15542 to 11910. [2019-12-18 15:03:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11910 states. [2019-12-18 15:03:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11910 states to 11910 states and 35757 transitions. [2019-12-18 15:03:00,442 INFO L78 Accepts]: Start accepts. Automaton has 11910 states and 35757 transitions. Word has length 65 [2019-12-18 15:03:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:00,442 INFO L462 AbstractCegarLoop]: Abstraction has 11910 states and 35757 transitions. [2019-12-18 15:03:00,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:03:00,442 INFO L276 IsEmpty]: Start isEmpty. Operand 11910 states and 35757 transitions. [2019-12-18 15:03:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 15:03:00,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:00,455 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 15:03:00,455 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 15:03:00,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:00,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1719627902, now seen corresponding path program 1 times [2019-12-18 15:03:00,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:00,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65359867] [2019-12-18 15:03:00,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:00,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65359867] [2019-12-18 15:03:00,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:00,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:03:00,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046543161] [2019-12-18 15:03:00,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:03:00,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:03:00,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:03:00,535 INFO L87 Difference]: Start difference. First operand 11910 states and 35757 transitions. Second operand 7 states. [2019-12-18 15:03:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:00,939 INFO L93 Difference]: Finished difference Result 22570 states and 66751 transitions. [2019-12-18 15:03:00,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:03:00,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 15:03:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:00,975 INFO L225 Difference]: With dead ends: 22570 [2019-12-18 15:03:00,976 INFO L226 Difference]: Without dead ends: 15632 [2019-12-18 15:03:00,976 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 15:03:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15632 states. [2019-12-18 15:03:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15632 to 13529. [2019-12-18 15:03:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13529 states. [2019-12-18 15:03:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13529 states to 13529 states and 40136 transitions. [2019-12-18 15:03:01,324 INFO L78 Accepts]: Start accepts. Automaton has 13529 states and 40136 transitions. Word has length 65 [2019-12-18 15:03:01,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:01,325 INFO L462 AbstractCegarLoop]: Abstraction has 13529 states and 40136 transitions. [2019-12-18 15:03:01,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:03:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 13529 states and 40136 transitions. [2019-12-18 15:03:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 15:03:01,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:01,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:01,340 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 15:03:01,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:01,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1672984364, now seen corresponding path program 2 times [2019-12-18 15:03:01,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:01,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916588452] [2019-12-18 15:03:01,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:01,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916588452] [2019-12-18 15:03:01,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:01,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:03:01,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420516105] [2019-12-18 15:03:01,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:03:01,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:01,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:03:01,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:03:01,399 INFO L87 Difference]: Start difference. First operand 13529 states and 40136 transitions. Second operand 3 states. [2019-12-18 15:03:01,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:01,509 INFO L93 Difference]: Finished difference Result 16037 states and 47606 transitions. [2019-12-18 15:03:01,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:03:01,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 15:03:01,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:01,536 INFO L225 Difference]: With dead ends: 16037 [2019-12-18 15:03:01,536 INFO L226 Difference]: Without dead ends: 16037 [2019-12-18 15:03:01,536 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 15:03:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16037 states. [2019-12-18 15:03:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16037 to 13637. [2019-12-18 15:03:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13637 states. [2019-12-18 15:03:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13637 states to 13637 states and 40658 transitions. [2019-12-18 15:03:01,950 INFO L78 Accepts]: Start accepts. Automaton has 13637 states and 40658 transitions. Word has length 65 [2019-12-18 15:03:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:01,951 INFO L462 AbstractCegarLoop]: Abstraction has 13637 states and 40658 transitions. [2019-12-18 15:03:01,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:03:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 13637 states and 40658 transitions. [2019-12-18 15:03:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:01,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:01,977 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 15:03:01,977 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 15:03:01,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:01,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1286211342, now seen corresponding path program 1 times [2019-12-18 15:03:01,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:01,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241405982] [2019-12-18 15:03:01,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:02,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241405982] [2019-12-18 15:03:02,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:02,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:03:02,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299910640] [2019-12-18 15:03:02,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:03:02,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:02,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:03:02,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:03:02,354 INFO L87 Difference]: Start difference. First operand 13637 states and 40658 transitions. Second operand 7 states. [2019-12-18 15:03:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:03,101 INFO L93 Difference]: Finished difference Result 19815 states and 57864 transitions. [2019-12-18 15:03:03,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:03:03,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 15:03:03,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:03,127 INFO L225 Difference]: With dead ends: 19815 [2019-12-18 15:03:03,127 INFO L226 Difference]: Without dead ends: 19815 [2019-12-18 15:03:03,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:03:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19815 states. [2019-12-18 15:03:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19815 to 14693. [2019-12-18 15:03:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14693 states. [2019-12-18 15:03:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14693 states to 14693 states and 43602 transitions. [2019-12-18 15:03:03,364 INFO L78 Accepts]: Start accepts. Automaton has 14693 states and 43602 transitions. Word has length 66 [2019-12-18 15:03:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:03,364 INFO L462 AbstractCegarLoop]: Abstraction has 14693 states and 43602 transitions. [2019-12-18 15:03:03,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:03:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 14693 states and 43602 transitions. [2019-12-18 15:03:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:03,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:03,379 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 15:03:03,379 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 15:03:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:03,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1142518902, now seen corresponding path program 2 times [2019-12-18 15:03:03,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:03,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397484906] [2019-12-18 15:03:03,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:03,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397484906] [2019-12-18 15:03:03,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:03,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:03:03,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659979884] [2019-12-18 15:03:03,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:03:03,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:03,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:03:03,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:03:03,459 INFO L87 Difference]: Start difference. First operand 14693 states and 43602 transitions. Second operand 4 states. [2019-12-18 15:03:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:03,576 INFO L93 Difference]: Finished difference Result 14495 states and 42853 transitions. [2019-12-18 15:03:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:03:03,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 15:03:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:03,600 INFO L225 Difference]: With dead ends: 14495 [2019-12-18 15:03:03,600 INFO L226 Difference]: Without dead ends: 14495 [2019-12-18 15:03:03,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:03:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14495 states. [2019-12-18 15:03:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14495 to 13733. [2019-12-18 15:03:03,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13733 states. [2019-12-18 15:03:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13733 states to 13733 states and 40478 transitions. [2019-12-18 15:03:03,805 INFO L78 Accepts]: Start accepts. Automaton has 13733 states and 40478 transitions. Word has length 66 [2019-12-18 15:03:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:03,805 INFO L462 AbstractCegarLoop]: Abstraction has 13733 states and 40478 transitions. [2019-12-18 15:03:03,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:03:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 13733 states and 40478 transitions. [2019-12-18 15:03:03,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:03,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:03,819 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 15:03:03,819 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 15:03:03,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:03,820 INFO L82 PathProgramCache]: Analyzing trace with hash -730206583, now seen corresponding path program 1 times [2019-12-18 15:03:03,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:03,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782370923] [2019-12-18 15:03:03,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:04,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782370923] [2019-12-18 15:03:04,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:04,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:03:04,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949180912] [2019-12-18 15:03:04,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:03:04,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:04,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:03:04,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:03:04,088 INFO L87 Difference]: Start difference. First operand 13733 states and 40478 transitions. Second operand 11 states. [2019-12-18 15:03:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:04,913 INFO L93 Difference]: Finished difference Result 22746 states and 66725 transitions. [2019-12-18 15:03:04,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 15:03:04,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 15:03:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:04,941 INFO L225 Difference]: With dead ends: 22746 [2019-12-18 15:03:04,941 INFO L226 Difference]: Without dead ends: 21137 [2019-12-18 15:03:04,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:03:05,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21137 states. [2019-12-18 15:03:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21137 to 18213. [2019-12-18 15:03:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18213 states. [2019-12-18 15:03:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18213 states to 18213 states and 53806 transitions. [2019-12-18 15:03:05,216 INFO L78 Accepts]: Start accepts. Automaton has 18213 states and 53806 transitions. Word has length 66 [2019-12-18 15:03:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:05,217 INFO L462 AbstractCegarLoop]: Abstraction has 18213 states and 53806 transitions. [2019-12-18 15:03:05,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:03:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 18213 states and 53806 transitions. [2019-12-18 15:03:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:05,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:05,234 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 15:03:05,234 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 15:03:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1941156117, now seen corresponding path program 2 times [2019-12-18 15:03:05,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:05,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937238446] [2019-12-18 15:03:05,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:05,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937238446] [2019-12-18 15:03:05,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:05,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:03:05,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978166570] [2019-12-18 15:03:05,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:03:05,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:05,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:03:05,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:03:05,419 INFO L87 Difference]: Start difference. First operand 18213 states and 53806 transitions. Second operand 11 states. [2019-12-18 15:03:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:07,060 INFO L93 Difference]: Finished difference Result 26011 states and 75121 transitions. [2019-12-18 15:03:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 15:03:07,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 15:03:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:07,094 INFO L225 Difference]: With dead ends: 26011 [2019-12-18 15:03:07,094 INFO L226 Difference]: Without dead ends: 26011 [2019-12-18 15:03:07,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:03:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26011 states. [2019-12-18 15:03:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26011 to 18663. [2019-12-18 15:03:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18663 states. [2019-12-18 15:03:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18663 states to 18663 states and 54829 transitions. [2019-12-18 15:03:07,390 INFO L78 Accepts]: Start accepts. Automaton has 18663 states and 54829 transitions. Word has length 66 [2019-12-18 15:03:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:07,391 INFO L462 AbstractCegarLoop]: Abstraction has 18663 states and 54829 transitions. [2019-12-18 15:03:07,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:03:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 18663 states and 54829 transitions. [2019-12-18 15:03:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:07,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:07,410 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 15:03:07,410 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:07,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash 435599595, now seen corresponding path program 3 times [2019-12-18 15:03:07,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:07,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867906313] [2019-12-18 15:03:07,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:08,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867906313] [2019-12-18 15:03:08,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:08,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:03:08,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135850314] [2019-12-18 15:03:08,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:03:08,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:08,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:03:08,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:03:08,028 INFO L87 Difference]: Start difference. First operand 18663 states and 54829 transitions. Second operand 17 states. [2019-12-18 15:03:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:11,750 INFO L93 Difference]: Finished difference Result 23457 states and 68201 transitions. [2019-12-18 15:03:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 15:03:11,751 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 15:03:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:11,779 INFO L225 Difference]: With dead ends: 23457 [2019-12-18 15:03:11,779 INFO L226 Difference]: Without dead ends: 21878 [2019-12-18 15:03:11,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=474, Invalid=2388, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 15:03:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21878 states. [2019-12-18 15:03:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21878 to 19997. [2019-12-18 15:03:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19997 states. [2019-12-18 15:03:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19997 states to 19997 states and 58674 transitions. [2019-12-18 15:03:12,158 INFO L78 Accepts]: Start accepts. Automaton has 19997 states and 58674 transitions. Word has length 66 [2019-12-18 15:03:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:12,158 INFO L462 AbstractCegarLoop]: Abstraction has 19997 states and 58674 transitions. [2019-12-18 15:03:12,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:03:12,158 INFO L276 IsEmpty]: Start isEmpty. Operand 19997 states and 58674 transitions. [2019-12-18 15:03:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:12,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:12,177 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 15:03:12,177 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:12,177 INFO L82 PathProgramCache]: Analyzing trace with hash 763066947, now seen corresponding path program 4 times [2019-12-18 15:03:12,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:12,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028621731] [2019-12-18 15:03:12,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:12,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028621731] [2019-12-18 15:03:12,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:12,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 15:03:12,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253356849] [2019-12-18 15:03:12,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:03:12,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:12,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:03:12,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:03:12,642 INFO L87 Difference]: Start difference. First operand 19997 states and 58674 transitions. Second operand 20 states. [2019-12-18 15:03:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:17,641 INFO L93 Difference]: Finished difference Result 31548 states and 91383 transitions. [2019-12-18 15:03:17,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 15:03:17,642 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-18 15:03:17,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:17,683 INFO L225 Difference]: With dead ends: 31548 [2019-12-18 15:03:17,683 INFO L226 Difference]: Without dead ends: 31539 [2019-12-18 15:03:17,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=606, Invalid=3554, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 15:03:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31539 states. [2019-12-18 15:03:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31539 to 21141. [2019-12-18 15:03:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21141 states. [2019-12-18 15:03:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21141 states to 21141 states and 62096 transitions. [2019-12-18 15:03:18,208 INFO L78 Accepts]: Start accepts. Automaton has 21141 states and 62096 transitions. Word has length 66 [2019-12-18 15:03:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:18,208 INFO L462 AbstractCegarLoop]: Abstraction has 21141 states and 62096 transitions. [2019-12-18 15:03:18,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:03:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 21141 states and 62096 transitions. [2019-12-18 15:03:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:18,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:18,229 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 15:03:18,229 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1853348035, now seen corresponding path program 5 times [2019-12-18 15:03:18,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:18,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825863143] [2019-12-18 15:03:18,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:18,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825863143] [2019-12-18 15:03:18,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:18,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:03:18,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159308031] [2019-12-18 15:03:18,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:03:18,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:03:18,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:03:18,297 INFO L87 Difference]: Start difference. First operand 21141 states and 62096 transitions. Second operand 3 states. [2019-12-18 15:03:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:18,379 INFO L93 Difference]: Finished difference Result 21140 states and 62094 transitions. [2019-12-18 15:03:18,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:03:18,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 15:03:18,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:18,414 INFO L225 Difference]: With dead ends: 21140 [2019-12-18 15:03:18,414 INFO L226 Difference]: Without dead ends: 21140 [2019-12-18 15:03:18,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:03:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21140 states. [2019-12-18 15:03:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21140 to 15932. [2019-12-18 15:03:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15932 states. [2019-12-18 15:03:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15932 states to 15932 states and 47498 transitions. [2019-12-18 15:03:18,678 INFO L78 Accepts]: Start accepts. Automaton has 15932 states and 47498 transitions. Word has length 66 [2019-12-18 15:03:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:18,678 INFO L462 AbstractCegarLoop]: Abstraction has 15932 states and 47498 transitions. [2019-12-18 15:03:18,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:03:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 15932 states and 47498 transitions. [2019-12-18 15:03:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:03:18,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:18,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:18,693 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:18,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:18,693 INFO L82 PathProgramCache]: Analyzing trace with hash 289864222, now seen corresponding path program 1 times [2019-12-18 15:03:18,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:18,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469018980] [2019-12-18 15:03:18,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:19,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469018980] [2019-12-18 15:03:19,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:19,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 15:03:19,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503734358] [2019-12-18 15:03:19,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:03:19,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:19,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:03:19,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:03:19,186 INFO L87 Difference]: Start difference. First operand 15932 states and 47498 transitions. Second operand 18 states. [2019-12-18 15:03:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:23,082 INFO L93 Difference]: Finished difference Result 23047 states and 67108 transitions. [2019-12-18 15:03:23,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 15:03:23,083 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-18 15:03:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:23,108 INFO L225 Difference]: With dead ends: 23047 [2019-12-18 15:03:23,109 INFO L226 Difference]: Without dead ends: 19436 [2019-12-18 15:03:23,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=468, Invalid=2394, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 15:03:23,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19436 states. [2019-12-18 15:03:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19436 to 16342. [2019-12-18 15:03:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16342 states. [2019-12-18 15:03:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 48429 transitions. [2019-12-18 15:03:23,352 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 48429 transitions. Word has length 67 [2019-12-18 15:03:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:23,352 INFO L462 AbstractCegarLoop]: Abstraction has 16342 states and 48429 transitions. [2019-12-18 15:03:23,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:03:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 48429 transitions. [2019-12-18 15:03:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:03:23,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:23,504 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 15:03:23,504 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:23,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1102267118, now seen corresponding path program 2 times [2019-12-18 15:03:23,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:23,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982386821] [2019-12-18 15:03:23,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:23,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982386821] [2019-12-18 15:03:23,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:23,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:03:23,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106895795] [2019-12-18 15:03:23,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:03:23,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:23,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:03:23,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:03:23,675 INFO L87 Difference]: Start difference. First operand 16342 states and 48429 transitions. Second operand 11 states. [2019-12-18 15:03:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:24,653 INFO L93 Difference]: Finished difference Result 19010 states and 55455 transitions. [2019-12-18 15:03:24,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:03:24,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 15:03:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:24,685 INFO L225 Difference]: With dead ends: 19010 [2019-12-18 15:03:24,685 INFO L226 Difference]: Without dead ends: 13666 [2019-12-18 15:03:24,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:03:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13666 states. [2019-12-18 15:03:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13666 to 11109. [2019-12-18 15:03:24,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11109 states. [2019-12-18 15:03:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11109 states to 11109 states and 32759 transitions. [2019-12-18 15:03:24,974 INFO L78 Accepts]: Start accepts. Automaton has 11109 states and 32759 transitions. Word has length 67 [2019-12-18 15:03:24,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:24,974 INFO L462 AbstractCegarLoop]: Abstraction has 11109 states and 32759 transitions. [2019-12-18 15:03:24,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:03:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 11109 states and 32759 transitions. [2019-12-18 15:03:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:03:24,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:24,990 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 15:03:24,992 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:24,993 INFO L82 PathProgramCache]: Analyzing trace with hash -164342018, now seen corresponding path program 3 times [2019-12-18 15:03:24,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:24,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998839793] [2019-12-18 15:03:24,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:25,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998839793] [2019-12-18 15:03:25,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:25,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 15:03:25,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658604033] [2019-12-18 15:03:25,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:03:25,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:25,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:03:25,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:03:25,529 INFO L87 Difference]: Start difference. First operand 11109 states and 32759 transitions. Second operand 19 states. [2019-12-18 15:03:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:27,871 INFO L93 Difference]: Finished difference Result 12123 states and 34521 transitions. [2019-12-18 15:03:27,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:03:27,872 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-18 15:03:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:27,887 INFO L225 Difference]: With dead ends: 12123 [2019-12-18 15:03:27,887 INFO L226 Difference]: Without dead ends: 11297 [2019-12-18 15:03:27,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=1350, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:03:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11297 states. [2019-12-18 15:03:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11297 to 10517. [2019-12-18 15:03:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10517 states. [2019-12-18 15:03:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10517 states to 10517 states and 30670 transitions. [2019-12-18 15:03:28,037 INFO L78 Accepts]: Start accepts. Automaton has 10517 states and 30670 transitions. Word has length 67 [2019-12-18 15:03:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:28,037 INFO L462 AbstractCegarLoop]: Abstraction has 10517 states and 30670 transitions. [2019-12-18 15:03:28,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:03:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 10517 states and 30670 transitions. [2019-12-18 15:03:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:03:28,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:28,048 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 15:03:28,048 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:28,049 INFO L82 PathProgramCache]: Analyzing trace with hash 289428518, now seen corresponding path program 4 times [2019-12-18 15:03:28,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:28,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891208173] [2019-12-18 15:03:28,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:28,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891208173] [2019-12-18 15:03:28,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:28,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 15:03:28,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344015639] [2019-12-18 15:03:28,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:03:28,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:28,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:03:28,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:03:28,559 INFO L87 Difference]: Start difference. First operand 10517 states and 30670 transitions. Second operand 20 states. [2019-12-18 15:03:31,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:31,128 INFO L93 Difference]: Finished difference Result 12105 states and 34473 transitions. [2019-12-18 15:03:31,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 15:03:31,129 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-18 15:03:31,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:31,144 INFO L225 Difference]: With dead ends: 12105 [2019-12-18 15:03:31,144 INFO L226 Difference]: Without dead ends: 11291 [2019-12-18 15:03:31,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=1498, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 15:03:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2019-12-18 15:03:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 10517. [2019-12-18 15:03:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10517 states. [2019-12-18 15:03:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10517 states to 10517 states and 30616 transitions. [2019-12-18 15:03:31,296 INFO L78 Accepts]: Start accepts. Automaton has 10517 states and 30616 transitions. Word has length 67 [2019-12-18 15:03:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:31,296 INFO L462 AbstractCegarLoop]: Abstraction has 10517 states and 30616 transitions. [2019-12-18 15:03:31,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:03:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 10517 states and 30616 transitions. [2019-12-18 15:03:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:03:31,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:31,307 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 15:03:31,307 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2063277766, now seen corresponding path program 5 times [2019-12-18 15:03:31,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:31,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747952415] [2019-12-18 15:03:31,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:31,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747952415] [2019-12-18 15:03:31,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:31,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:03:31,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450445780] [2019-12-18 15:03:31,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:03:31,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:03:31,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:03:31,458 INFO L87 Difference]: Start difference. First operand 10517 states and 30616 transitions. Second operand 11 states. [2019-12-18 15:03:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:32,189 INFO L93 Difference]: Finished difference Result 13036 states and 37200 transitions. [2019-12-18 15:03:32,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:03:32,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 15:03:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:32,206 INFO L225 Difference]: With dead ends: 13036 [2019-12-18 15:03:32,206 INFO L226 Difference]: Without dead ends: 12132 [2019-12-18 15:03:32,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:03:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12132 states. [2019-12-18 15:03:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12132 to 9849. [2019-12-18 15:03:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2019-12-18 15:03:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 28892 transitions. [2019-12-18 15:03:32,357 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 28892 transitions. Word has length 67 [2019-12-18 15:03:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:32,358 INFO L462 AbstractCegarLoop]: Abstraction has 9849 states and 28892 transitions. [2019-12-18 15:03:32,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:03:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 28892 transitions. [2019-12-18 15:03:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:03:32,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:32,368 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 15:03:32,368 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:32,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:32,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 6 times [2019-12-18 15:03:32,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:32,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535907314] [2019-12-18 15:03:32,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:03:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:03:32,479 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:03:32,479 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:03:32,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2393~0.base_39|) (= v_~y$r_buff1_thd0~0_201 0) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2393~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2393~0.base_39|) |v_ULTIMATE.start_main_~#t2393~0.offset_26| 0)) |v_#memory_int_23|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2393~0.base_39| 4)) (= |v_ULTIMATE.start_main_~#t2393~0.offset_26| 0) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2393~0.base_39| 1)) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2393~0.base_39|)) (= 0 v_~y$r_buff1_thd2~0_197) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_~#t2395~0.base=|v_ULTIMATE.start_main_~#t2395~0.base_27|, ULTIMATE.start_main_~#t2395~0.offset=|v_ULTIMATE.start_main_~#t2395~0.offset_20|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_~#t2393~0.base=|v_ULTIMATE.start_main_~#t2393~0.base_39|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ULTIMATE.start_main_~#t2394~0.offset=|v_ULTIMATE.start_main_~#t2394~0.offset_25|, ~y~0=v_~y~0_189, ULTIMATE.start_main_~#t2394~0.base=|v_ULTIMATE.start_main_~#t2394~0.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t2393~0.offset=|v_ULTIMATE.start_main_~#t2393~0.offset_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t2395~0.base, ULTIMATE.start_main_~#t2395~0.offset, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_~#t2393~0.base, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2394~0.offset, ~y~0, ULTIMATE.start_main_~#t2394~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t2393~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:03:32,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= 0 (mod v_~y$w_buff1_used~0_76 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:03:32,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2394~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2394~0.base_11|) |v_ULTIMATE.start_main_~#t2394~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2394~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2394~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2394~0.base_11|) (= |v_ULTIMATE.start_main_~#t2394~0.offset_10| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2394~0.base_11| 4) |v_#length_17|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2394~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2394~0.base=|v_ULTIMATE.start_main_~#t2394~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2394~0.offset=|v_ULTIMATE.start_main_~#t2394~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2394~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2394~0.offset] because there is no mapped edge [2019-12-18 15:03:32,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2395~0.base_11| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2395~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2395~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2395~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2395~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2395~0.base_11|) |v_ULTIMATE.start_main_~#t2395~0.offset_10| 2)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t2395~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2395~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2395~0.base=|v_ULTIMATE.start_main_~#t2395~0.base_11|, ULTIMATE.start_main_~#t2395~0.offset=|v_ULTIMATE.start_main_~#t2395~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2395~0.base, ULTIMATE.start_main_~#t2395~0.offset] because there is no mapped edge [2019-12-18 15:03:32,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In546318595 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite24_Out546318595| |P2Thread1of1ForFork2_#t~ite23_Out546318595|) (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In546318595 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In546318595 256)) (and (= 0 (mod ~y$r_buff1_thd3~0_In546318595 256)) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In546318595 256) 0)))) (= |P2Thread1of1ForFork2_#t~ite23_Out546318595| ~y$w_buff1~0_In546318595) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite24_Out546318595| ~y$w_buff1~0_In546318595) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite23_In546318595| |P2Thread1of1ForFork2_#t~ite23_Out546318595|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In546318595|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In546318595, ~y$w_buff1~0=~y$w_buff1~0_In546318595, ~y$w_buff0_used~0=~y$w_buff0_used~0_In546318595, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In546318595, ~weak$$choice2~0=~weak$$choice2~0_In546318595, ~y$w_buff1_used~0=~y$w_buff1_used~0_In546318595} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out546318595|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out546318595|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In546318595, ~y$w_buff1~0=~y$w_buff1~0_In546318595, ~y$w_buff0_used~0=~y$w_buff0_used~0_In546318595, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In546318595, ~weak$$choice2~0=~weak$$choice2~0_In546318595, ~y$w_buff1_used~0=~y$w_buff1_used~0_In546318595} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 15:03:32,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1017931796 256) 0))) (or (and (= ~y$w_buff0_used~0_In1017931796 |P2Thread1of1ForFork2_#t~ite27_Out1017931796|) (= |P2Thread1of1ForFork2_#t~ite26_In1017931796| |P2Thread1of1ForFork2_#t~ite26_Out1017931796|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite26_Out1017931796| |P2Thread1of1ForFork2_#t~ite27_Out1017931796|) (= |P2Thread1of1ForFork2_#t~ite26_Out1017931796| ~y$w_buff0_used~0_In1017931796) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1017931796 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1017931796 256))) (and (= 0 (mod ~y$w_buff1_used~0_In1017931796 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1017931796 256)))) .cse0))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1017931796, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1017931796|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1017931796, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1017931796, ~weak$$choice2~0=~weak$$choice2~0_In1017931796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1017931796} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1017931796|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1017931796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1017931796, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1017931796, ~weak$$choice2~0=~weak$$choice2~0_In1017931796, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1017931796|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1017931796} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 15:03:32,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1222817280 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite30_Out-1222817280| ~y$w_buff1_used~0_In-1222817280) (= |P2Thread1of1ForFork2_#t~ite29_In-1222817280| |P2Thread1of1ForFork2_#t~ite29_Out-1222817280|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out-1222817280| |P2Thread1of1ForFork2_#t~ite30_Out-1222817280|) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1222817280 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd3~0_In-1222817280 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1222817280 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1222817280 256) 0)))) (= |P2Thread1of1ForFork2_#t~ite29_Out-1222817280| ~y$w_buff1_used~0_In-1222817280)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1222817280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222817280, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1222817280, ~weak$$choice2~0=~weak$$choice2~0_In-1222817280, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-1222817280|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1222817280} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1222817280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1222817280, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1222817280|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1222817280, ~weak$$choice2~0=~weak$$choice2~0_In-1222817280, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1222817280|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1222817280} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 15:03:32,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_10|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 15:03:32,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 15:03:32,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1314129675 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1314129675 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1314129675| ~y~0_In-1314129675) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-1314129675| ~y$w_buff1~0_In-1314129675)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1314129675, ~y$w_buff1~0=~y$w_buff1~0_In-1314129675, ~y~0=~y~0_In-1314129675, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314129675} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1314129675, ~y$w_buff1~0=~y$w_buff1~0_In-1314129675, ~y~0=~y~0_In-1314129675, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1314129675|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314129675} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 15:03:32,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1962401075 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1962401075 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1962401075| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1962401075| ~y$w_buff0_used~0_In-1962401075) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1962401075, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1962401075} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1962401075|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1962401075, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1962401075} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 15:03:32,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In607254649 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In607254649 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In607254649 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In607254649 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out607254649|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In607254649 |P0Thread1of1ForFork0_#t~ite6_Out607254649|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In607254649, ~y$w_buff0_used~0=~y$w_buff0_used~0_In607254649, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In607254649, ~y$w_buff1_used~0=~y$w_buff1_used~0_In607254649} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out607254649|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In607254649, ~y$w_buff0_used~0=~y$w_buff0_used~0_In607254649, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In607254649, ~y$w_buff1_used~0=~y$w_buff1_used~0_In607254649} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 15:03:32,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out1787368570| |P1Thread1of1ForFork1_#t~ite9_Out1787368570|)) (.cse0 (= (mod ~y$w_buff1_used~0_In1787368570 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1787368570 256) 0))) (or (and (not .cse0) (not .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out1787368570| ~y$w_buff1~0_In1787368570)) (and .cse2 (= ~y~0_In1787368570 |P1Thread1of1ForFork1_#t~ite9_Out1787368570|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1787368570, ~y$w_buff1~0=~y$w_buff1~0_In1787368570, ~y~0=~y~0_In1787368570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1787368570} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1787368570, ~y$w_buff1~0=~y$w_buff1~0_In1787368570, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1787368570|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1787368570|, ~y~0=~y~0_In1787368570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1787368570} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 15:03:32,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_12|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_12|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_7|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_11|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 15:03:32,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2138170486 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2138170486 256)))) (or (and (= ~y$w_buff0_used~0_In-2138170486 |P2Thread1of1ForFork2_#t~ite40_Out-2138170486|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-2138170486|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2138170486, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2138170486} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2138170486, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2138170486, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-2138170486|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 15:03:32,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1658193905 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1658193905 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1658193905 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1658193905 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out1658193905| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite41_Out1658193905| ~y$w_buff1_used~0_In1658193905) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1658193905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1658193905, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1658193905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658193905} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1658193905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1658193905, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1658193905|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1658193905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658193905} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 15:03:32,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In135541071 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In135541071 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out135541071| ~y$r_buff0_thd3~0_In135541071) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out135541071| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In135541071, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In135541071} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In135541071, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out135541071|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In135541071} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 15:03:32,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-1072874886 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1072874886 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1072874886 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1072874886 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1072874886| 0)) (and (= ~y$r_buff1_thd3~0_In-1072874886 |P2Thread1of1ForFork2_#t~ite43_Out-1072874886|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1072874886, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1072874886, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1072874886, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1072874886} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1072874886, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1072874886, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1072874886, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1072874886|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1072874886} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 15:03:32,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-710455967 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-710455967 256)))) (or (and (= ~y$r_buff0_thd1~0_Out-710455967 ~y$r_buff0_thd1~0_In-710455967) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out-710455967 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-710455967, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-710455967} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-710455967, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-710455967|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-710455967} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 15:03:32,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1920851308 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1920851308 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1920851308 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1920851308 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In1920851308 |P0Thread1of1ForFork0_#t~ite8_Out1920851308|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1920851308|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1920851308, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1920851308, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1920851308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1920851308} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1920851308, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1920851308, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1920851308|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1920851308, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1920851308} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 15:03:32,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 15:03:32,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_34| v_~y$r_buff1_thd3~0_152) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_33|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 15:03:32,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In787533039 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In787533039 256) 0))) (or (and (= ~y$w_buff0_used~0_In787533039 |P1Thread1of1ForFork1_#t~ite11_Out787533039|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out787533039| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In787533039, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In787533039} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In787533039, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In787533039, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out787533039|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 15:03:32,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1682923523 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1682923523 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1682923523 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1682923523 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1682923523|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1682923523 |P1Thread1of1ForFork1_#t~ite12_Out-1682923523|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1682923523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1682923523, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1682923523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1682923523} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1682923523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1682923523, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1682923523, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1682923523|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1682923523} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 15:03:32,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-726180853 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-726180853 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-726180853 |P1Thread1of1ForFork1_#t~ite13_Out-726180853|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-726180853|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-726180853, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-726180853} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-726180853, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-726180853, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-726180853|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 15:03:32,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-2140932678 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-2140932678 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-2140932678 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2140932678 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-2140932678 |P1Thread1of1ForFork1_#t~ite14_Out-2140932678|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-2140932678|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2140932678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140932678, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2140932678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2140932678} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2140932678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2140932678, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2140932678, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2140932678|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2140932678} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 15:03:32,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 15:03:32,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 15:03:32,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1859884093 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1859884093 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1859884093| ~y$w_buff1~0_In-1859884093)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1859884093| ~y~0_In-1859884093)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1859884093, ~y~0=~y~0_In-1859884093, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1859884093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1859884093} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1859884093, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1859884093|, ~y~0=~y~0_In-1859884093, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1859884093, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1859884093} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 15:03:32,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-18 15:03:32,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1002495513 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1002495513 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1002495513 |ULTIMATE.start_main_#t~ite49_Out1002495513|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1002495513|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1002495513, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1002495513} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1002495513, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1002495513, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1002495513|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 15:03:32,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1705408910 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1705408910 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1705408910 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1705408910 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1705408910| ~y$w_buff1_used~0_In1705408910) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out1705408910| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1705408910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1705408910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1705408910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1705408910} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1705408910|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1705408910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1705408910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1705408910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1705408910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 15:03:32,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In476149534 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In476149534 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out476149534| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out476149534| ~y$r_buff0_thd0~0_In476149534) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In476149534, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In476149534} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out476149534|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In476149534, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In476149534} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 15:03:32,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In677552315 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In677552315 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In677552315 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In677552315 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out677552315| ~y$r_buff1_thd0~0_In677552315) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out677552315| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In677552315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In677552315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In677552315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In677552315} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out677552315|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In677552315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In677552315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In677552315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In677552315} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 15:03:32,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= 2 v_~x~0_130) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:03:32,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:03:32 BasicIcfg [2019-12-18 15:03:32,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:03:32,604 INFO L168 Benchmark]: Toolchain (without parser) took 189855.85 ms. Allocated memory was 144.7 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 15:03:32,605 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 15:03:32,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.59 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:03:32,605 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.88 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:03:32,606 INFO L168 Benchmark]: Boogie Preprocessor took 42.52 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:03:32,606 INFO L168 Benchmark]: RCFGBuilder took 915.04 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 101.4 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:03:32,607 INFO L168 Benchmark]: TraceAbstraction took 188069.70 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 15:03:32,609 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.47 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.59 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.8 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.88 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.52 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 915.04 ms. Allocated memory is still 202.4 MB. Free memory was 151.0 MB in the beginning and 101.4 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188069.70 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 187.7s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 76.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6613 SDtfs, 10844 SDslu, 25846 SDs, 0 SdLazy, 21897 SolverSat, 595 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 56 SyntacticMatches, 28 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3541 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206903occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 81.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 209673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1571 NumberOfCodeBlocks, 1571 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1470 ConstructedInterpolants, 0 QuantifiedInterpolants, 407657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...