/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:50:57,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:50:57,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:50:57,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:50:57,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:50:57,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:50:57,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:50:57,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:50:57,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:50:57,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:50:57,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:50:57,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:50:57,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:50:57,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:50:57,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:50:57,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:50:57,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:50:57,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:50:57,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:50:57,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:50:57,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:50:57,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:50:57,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:50:57,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:50:57,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:50:57,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:50:57,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:50:57,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:50:57,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:50:57,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:50:57,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:50:57,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:50:57,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:50:57,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:50:57,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:50:57,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:50:57,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:50:57,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:50:57,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:50:57,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:50:57,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:50:57,535 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:50:57,562 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:50:57,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:50:57,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:50:57,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:50:57,566 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:50:57,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:50:57,566 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:50:57,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:50:57,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:50:57,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:50:57,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:50:57,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:50:57,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:50:57,568 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:50:57,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:50:57,569 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:50:57,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:50:57,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:50:57,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:50:57,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:50:57,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:50:57,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:50:57,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:50:57,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:50:57,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:50:57,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:50:57,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:50:57,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:50:57,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:50:57,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:50:57,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:50:57,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:50:57,866 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:50:57,867 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:50:57,867 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc.i [2019-12-18 16:50:57,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498754eb2/7e057528aa8144e2b9f5513c629f5e87/FLAG14fbd4da3 [2019-12-18 16:50:58,487 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:50:58,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc.i [2019-12-18 16:50:58,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498754eb2/7e057528aa8144e2b9f5513c629f5e87/FLAG14fbd4da3 [2019-12-18 16:50:58,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498754eb2/7e057528aa8144e2b9f5513c629f5e87 [2019-12-18 16:50:58,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:50:58,838 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:50:58,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:50:58,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:50:58,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:50:58,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:50:58" (1/1) ... [2019-12-18 16:50:58,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8fd7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:58, skipping insertion in model container [2019-12-18 16:50:58,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:50:58" (1/1) ... [2019-12-18 16:50:58,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:50:58,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:50:59,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:50:59,473 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:50:59,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:50:59,644 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:50:59,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59 WrapperNode [2019-12-18 16:50:59,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:50:59,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:50:59,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:50:59,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:50:59,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59" (1/1) ... [2019-12-18 16:50:59,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59" (1/1) ... [2019-12-18 16:50:59,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:50:59,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:50:59,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:50:59,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:50:59,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59" (1/1) ... [2019-12-18 16:50:59,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59" (1/1) ... [2019-12-18 16:50:59,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59" (1/1) ... [2019-12-18 16:50:59,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59" (1/1) ... [2019-12-18 16:50:59,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59" (1/1) ... [2019-12-18 16:50:59,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59" (1/1) ... [2019-12-18 16:50:59,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59" (1/1) ... [2019-12-18 16:50:59,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:50:59,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:50:59,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:50:59,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:50:59,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59" (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 16:50:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:50:59,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:50:59,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:50:59,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:50:59,819 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:50:59,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:50:59,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:50:59,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:50:59,823 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:50:59,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:50:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:50:59,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:50:59,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:50:59,828 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 16:51:00,551 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:51:00,552 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:51:00,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:51:00 BoogieIcfgContainer [2019-12-18 16:51:00,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:51:00,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:51:00,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:51:00,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:51:00,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:50:58" (1/3) ... [2019-12-18 16:51:00,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d82485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:51:00, skipping insertion in model container [2019-12-18 16:51:00,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:50:59" (2/3) ... [2019-12-18 16:51:00,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d82485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:51:00, skipping insertion in model container [2019-12-18 16:51:00,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:51:00" (3/3) ... [2019-12-18 16:51:00,562 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc.i [2019-12-18 16:51:00,572 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:51:00,573 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:51:00,581 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:51:00,582 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:51:00,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,626 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,626 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,635 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,635 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,644 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,644 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,691 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,693 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,707 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,707 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:51:00,723 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:51:00,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:51:00,739 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:51:00,739 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:51:00,739 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:51:00,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:51:00,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:51:00,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:51:00,740 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:51:00,757 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 16:51:00,759 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 16:51:00,842 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 16:51:00,843 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:51:00,859 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:51:00,887 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 16:51:00,935 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 16:51:00,935 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:51:00,946 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:51:00,974 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 16:51:00,976 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:51:06,021 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 16:51:06,142 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 16:51:06,396 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-18 16:51:06,397 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 16:51:06,400 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-18 16:51:27,236 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-18 16:51:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-18 16:51:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:51:27,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:27,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:51:27,245 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 16:51:27,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:27,250 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-18 16:51:27,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:27,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904255796] [2019-12-18 16:51:27,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:27,483 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 16:51:27,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904255796] [2019-12-18 16:51:27,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:27,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:51:27,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149632838] [2019-12-18 16:51:27,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:51:27,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:51:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:51:27,508 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-18 16:51:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:30,315 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-18 16:51:30,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:51:30,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:51:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:31,217 INFO L225 Difference]: With dead ends: 121140 [2019-12-18 16:51:31,217 INFO L226 Difference]: Without dead ends: 107958 [2019-12-18 16:51:31,219 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 16:51:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-18 16:51:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-18 16:51:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-18 16:51:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-18 16:51:43,997 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-18 16:51:43,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:51:43,998 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-18 16:51:43,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:51:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-18 16:51:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:51:44,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:51:44,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:51:44,003 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 16:51:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:51:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-18 16:51:44,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:51:44,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143845938] [2019-12-18 16:51:44,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:51:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:51:44,123 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 16:51:44,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143845938] [2019-12-18 16:51:44,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:51:44,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:51:44,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919923622] [2019-12-18 16:51:44,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:51:44,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:51:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:51:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:51:44,128 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-18 16:51:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:51:50,438 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-18 16:51:50,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:51:50,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:51:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:51:50,977 INFO L225 Difference]: With dead ends: 172022 [2019-12-18 16:51:50,978 INFO L226 Difference]: Without dead ends: 171924 [2019-12-18 16:51:50,979 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 16:51:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-18 16:51:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-18 16:51:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-18 16:52:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-18 16:52:00,216 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-18 16:52:00,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:00,216 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-18 16:52:00,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:52:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-18 16:52:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:52:00,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:00,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:00,223 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 16:52:00,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-18 16:52:00,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:00,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565349619] [2019-12-18 16:52:00,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:00,283 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 16:52:00,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565349619] [2019-12-18 16:52:00,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:00,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:00,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956284332] [2019-12-18 16:52:00,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:00,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:00,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:00,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:00,286 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-18 16:52:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:00,428 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-18 16:52:00,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:00,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:52:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:00,501 INFO L225 Difference]: With dead ends: 33388 [2019-12-18 16:52:00,502 INFO L226 Difference]: Without dead ends: 33388 [2019-12-18 16:52:00,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-18 16:52:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-18 16:52:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-18 16:52:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-18 16:52:05,826 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-18 16:52:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:05,826 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-18 16:52:05,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:52:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-18 16:52:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:52:05,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:05,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:05,831 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 16:52:05,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:05,831 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-18 16:52:05,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:05,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774885103] [2019-12-18 16:52:05,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:05,934 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 16:52:05,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774885103] [2019-12-18 16:52:05,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:05,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:52:05,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653098442] [2019-12-18 16:52:05,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:05,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:05,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:05,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:05,937 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-18 16:52:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:06,213 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-18 16:52:06,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:06,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 16:52:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:06,318 INFO L225 Difference]: With dead ends: 52822 [2019-12-18 16:52:06,318 INFO L226 Difference]: Without dead ends: 52822 [2019-12-18 16:52:06,319 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 16:52:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-18 16:52:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-18 16:52:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-18 16:52:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-18 16:52:07,063 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-18 16:52:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:07,065 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-18 16:52:07,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:52:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-18 16:52:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:52:07,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:07,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:07,069 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 16:52:07,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-18 16:52:07,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:07,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404207095] [2019-12-18 16:52:07,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:07,137 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 16:52:07,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404207095] [2019-12-18 16:52:07,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:07,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:07,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29097977] [2019-12-18 16:52:07,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:52:07,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:07,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:52:07,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:52:07,140 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-18 16:52:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:07,487 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-18 16:52:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:52:07,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:52:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:07,916 INFO L225 Difference]: With dead ends: 46903 [2019-12-18 16:52:07,916 INFO L226 Difference]: Without dead ends: 46903 [2019-12-18 16:52:07,917 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 16:52:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-18 16:52:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-18 16:52:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 16:52:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-18 16:52:08,596 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-18 16:52:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:08,596 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-18 16:52:08,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:52:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-18 16:52:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:52:08,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:08,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:08,600 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 16:52:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:08,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-18 16:52:08,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:08,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167564435] [2019-12-18 16:52:08,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:08,660 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 16:52:08,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167564435] [2019-12-18 16:52:08,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:08,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:08,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146730394] [2019-12-18 16:52:08,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:52:08,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:08,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:52:08,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:52:08,662 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-18 16:52:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:09,003 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-18 16:52:09,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:52:09,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:52:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:09,123 INFO L225 Difference]: With dead ends: 51478 [2019-12-18 16:52:09,123 INFO L226 Difference]: Without dead ends: 51478 [2019-12-18 16:52:09,123 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 16:52:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-18 16:52:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-18 16:52:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-18 16:52:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-18 16:52:10,282 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-18 16:52:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:10,283 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-18 16:52:10,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:52:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-18 16:52:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:52:10,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:10,292 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 16:52:10,293 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 16:52:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:10,293 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-18 16:52:10,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:10,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257919185] [2019-12-18 16:52:10,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:10,412 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 16:52:10,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257919185] [2019-12-18 16:52:10,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:10,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:52:10,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314043740] [2019-12-18 16:52:10,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:52:10,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:10,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:52:10,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:52:10,415 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 6 states. [2019-12-18 16:52:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:11,191 INFO L93 Difference]: Finished difference Result 61274 states and 194553 transitions. [2019-12-18 16:52:11,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:52:11,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 16:52:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:11,294 INFO L225 Difference]: With dead ends: 61274 [2019-12-18 16:52:11,295 INFO L226 Difference]: Without dead ends: 61260 [2019-12-18 16:52:11,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:52:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61260 states. [2019-12-18 16:52:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61260 to 45714. [2019-12-18 16:52:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45714 states. [2019-12-18 16:52:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45714 states to 45714 states and 148005 transitions. [2019-12-18 16:52:12,721 INFO L78 Accepts]: Start accepts. Automaton has 45714 states and 148005 transitions. Word has length 22 [2019-12-18 16:52:12,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:12,722 INFO L462 AbstractCegarLoop]: Abstraction has 45714 states and 148005 transitions. [2019-12-18 16:52:12,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:52:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 45714 states and 148005 transitions. [2019-12-18 16:52:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:52:12,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:12,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:12,732 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 16:52:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:12,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-18 16:52:12,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:12,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704616366] [2019-12-18 16:52:12,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:12,805 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 16:52:12,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704616366] [2019-12-18 16:52:12,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:12,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:52:12,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684377964] [2019-12-18 16:52:12,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:52:12,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:12,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:52:12,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:52:12,807 INFO L87 Difference]: Start difference. First operand 45714 states and 148005 transitions. Second operand 5 states. [2019-12-18 16:52:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:13,494 INFO L93 Difference]: Finished difference Result 64138 states and 202903 transitions. [2019-12-18 16:52:13,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:52:13,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:52:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:13,651 INFO L225 Difference]: With dead ends: 64138 [2019-12-18 16:52:13,652 INFO L226 Difference]: Without dead ends: 64124 [2019-12-18 16:52:13,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:13,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64124 states. [2019-12-18 16:52:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64124 to 44294. [2019-12-18 16:52:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44294 states. [2019-12-18 16:52:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44294 states to 44294 states and 143524 transitions. [2019-12-18 16:52:14,533 INFO L78 Accepts]: Start accepts. Automaton has 44294 states and 143524 transitions. Word has length 22 [2019-12-18 16:52:14,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:14,534 INFO L462 AbstractCegarLoop]: Abstraction has 44294 states and 143524 transitions. [2019-12-18 16:52:14,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:52:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 44294 states and 143524 transitions. [2019-12-18 16:52:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:52:14,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:14,547 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 16:52:14,547 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 16:52:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-18 16:52:14,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:14,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141298050] [2019-12-18 16:52:14,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:52:14,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141298050] [2019-12-18 16:52:14,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:14,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:52:14,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636545034] [2019-12-18 16:52:14,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:52:14,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:14,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:52:14,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:52:14,597 INFO L87 Difference]: Start difference. First operand 44294 states and 143524 transitions. Second operand 4 states. [2019-12-18 16:52:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:14,691 INFO L93 Difference]: Finished difference Result 17338 states and 53060 transitions. [2019-12-18 16:52:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:52:14,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:52:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:14,721 INFO L225 Difference]: With dead ends: 17338 [2019-12-18 16:52:14,722 INFO L226 Difference]: Without dead ends: 17338 [2019-12-18 16:52:14,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:52:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17338 states. [2019-12-18 16:52:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17338 to 16975. [2019-12-18 16:52:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16975 states. [2019-12-18 16:52:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16975 states to 16975 states and 52024 transitions. [2019-12-18 16:52:15,290 INFO L78 Accepts]: Start accepts. Automaton has 16975 states and 52024 transitions. Word has length 25 [2019-12-18 16:52:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:15,291 INFO L462 AbstractCegarLoop]: Abstraction has 16975 states and 52024 transitions. [2019-12-18 16:52:15,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:52:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 16975 states and 52024 transitions. [2019-12-18 16:52:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 16:52:15,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:15,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:15,304 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 16:52:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:15,304 INFO L82 PathProgramCache]: Analyzing trace with hash 987898618, now seen corresponding path program 1 times [2019-12-18 16:52:15,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:15,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752174064] [2019-12-18 16:52:15,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:15,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 16:52:15,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752174064] [2019-12-18 16:52:15,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:15,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:52:15,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701587628] [2019-12-18 16:52:15,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:52:15,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:15,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:52:15,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:52:15,400 INFO L87 Difference]: Start difference. First operand 16975 states and 52024 transitions. Second operand 6 states. [2019-12-18 16:52:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:15,876 INFO L93 Difference]: Finished difference Result 22778 states and 68491 transitions. [2019-12-18 16:52:15,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:52:15,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 16:52:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:15,907 INFO L225 Difference]: With dead ends: 22778 [2019-12-18 16:52:15,907 INFO L226 Difference]: Without dead ends: 22778 [2019-12-18 16:52:15,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22778 states. [2019-12-18 16:52:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22778 to 16865. [2019-12-18 16:52:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-18 16:52:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51692 transitions. [2019-12-18 16:52:16,184 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51692 transitions. Word has length 26 [2019-12-18 16:52:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:16,184 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51692 transitions. [2019-12-18 16:52:16,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:52:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51692 transitions. [2019-12-18 16:52:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 16:52:16,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:16,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:16,196 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 16:52:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-18 16:52:16,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:16,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840936311] [2019-12-18 16:52:16,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:52:16,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840936311] [2019-12-18 16:52:16,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:16,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:52:16,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675229076] [2019-12-18 16:52:16,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:52:16,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:16,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:52:16,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:52:16,269 INFO L87 Difference]: Start difference. First operand 16865 states and 51692 transitions. Second operand 5 states. [2019-12-18 16:52:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:16,689 INFO L93 Difference]: Finished difference Result 21613 states and 65114 transitions. [2019-12-18 16:52:16,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:52:16,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 16:52:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:16,736 INFO L225 Difference]: With dead ends: 21613 [2019-12-18 16:52:16,737 INFO L226 Difference]: Without dead ends: 21613 [2019-12-18 16:52:16,737 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 16:52:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-18 16:52:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-18 16:52:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-18 16:52:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61624 transitions. [2019-12-18 16:52:17,142 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61624 transitions. Word has length 26 [2019-12-18 16:52:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:17,143 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61624 transitions. [2019-12-18 16:52:17,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:52:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61624 transitions. [2019-12-18 16:52:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:52:17,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:17,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:17,158 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 16:52:17,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:17,158 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-18 16:52:17,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:17,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543216189] [2019-12-18 16:52:17,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:17,222 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 16:52:17,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543216189] [2019-12-18 16:52:17,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:17,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:52:17,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482012630] [2019-12-18 16:52:17,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:52:17,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:17,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:52:17,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:52:17,224 INFO L87 Difference]: Start difference. First operand 20225 states and 61624 transitions. Second operand 5 states. [2019-12-18 16:52:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:17,570 INFO L93 Difference]: Finished difference Result 23624 states and 70881 transitions. [2019-12-18 16:52:17,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:52:17,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:52:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:17,607 INFO L225 Difference]: With dead ends: 23624 [2019-12-18 16:52:17,607 INFO L226 Difference]: Without dead ends: 23624 [2019-12-18 16:52:17,607 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 16:52:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-18 16:52:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-18 16:52:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-18 16:52:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59271 transitions. [2019-12-18 16:52:17,921 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59271 transitions. Word has length 28 [2019-12-18 16:52:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:17,921 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59271 transitions. [2019-12-18 16:52:17,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:52:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59271 transitions. [2019-12-18 16:52:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 16:52:17,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:17,941 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] [2019-12-18 16:52:17,941 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 16:52:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-18 16:52:17,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:17,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549293185] [2019-12-18 16:52:17,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:18,012 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 16:52:18,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549293185] [2019-12-18 16:52:18,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:18,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:52:18,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000425700] [2019-12-18 16:52:18,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:52:18,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:52:18,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:52:18,014 INFO L87 Difference]: Start difference. First operand 19452 states and 59271 transitions. Second operand 6 states. [2019-12-18 16:52:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:18,888 INFO L93 Difference]: Finished difference Result 27031 states and 80489 transitions. [2019-12-18 16:52:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:52:18,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 16:52:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:18,936 INFO L225 Difference]: With dead ends: 27031 [2019-12-18 16:52:18,936 INFO L226 Difference]: Without dead ends: 27031 [2019-12-18 16:52:18,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:52:19,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-18 16:52:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-18 16:52:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-18 16:52:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63058 transitions. [2019-12-18 16:52:19,277 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63058 transitions. Word has length 32 [2019-12-18 16:52:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:19,277 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63058 transitions. [2019-12-18 16:52:19,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:52:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63058 transitions. [2019-12-18 16:52:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:52:19,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:19,298 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] [2019-12-18 16:52:19,298 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 16:52:19,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:19,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-18 16:52:19,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:19,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749396018] [2019-12-18 16:52:19,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:19,387 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 16:52:19,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749396018] [2019-12-18 16:52:19,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:19,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:52:19,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152841657] [2019-12-18 16:52:19,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:52:19,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:19,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:52:19,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:52:19,390 INFO L87 Difference]: Start difference. First operand 20764 states and 63058 transitions. Second operand 6 states. [2019-12-18 16:52:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:20,132 INFO L93 Difference]: Finished difference Result 26334 states and 78671 transitions. [2019-12-18 16:52:20,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:52:20,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 16:52:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:20,190 INFO L225 Difference]: With dead ends: 26334 [2019-12-18 16:52:20,190 INFO L226 Difference]: Without dead ends: 26334 [2019-12-18 16:52:20,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:52:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-18 16:52:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-18 16:52:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-18 16:52:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53944 transitions. [2019-12-18 16:52:20,532 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53944 transitions. Word has length 34 [2019-12-18 16:52:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:20,533 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53944 transitions. [2019-12-18 16:52:20,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:52:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53944 transitions. [2019-12-18 16:52:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:52:20,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:20,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:20,551 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 16:52:20,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:20,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-18 16:52:20,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:20,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058873697] [2019-12-18 16:52:20,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:20,604 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 16:52:20,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058873697] [2019-12-18 16:52:20,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:20,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:52:20,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586683158] [2019-12-18 16:52:20,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:20,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:20,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:20,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:20,606 INFO L87 Difference]: Start difference. First operand 17642 states and 53944 transitions. Second operand 3 states. [2019-12-18 16:52:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:20,680 INFO L93 Difference]: Finished difference Result 17641 states and 53942 transitions. [2019-12-18 16:52:20,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:20,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:52:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:20,717 INFO L225 Difference]: With dead ends: 17641 [2019-12-18 16:52:20,718 INFO L226 Difference]: Without dead ends: 17641 [2019-12-18 16:52:20,718 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 16:52:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-18 16:52:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-18 16:52:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-18 16:52:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53942 transitions. [2019-12-18 16:52:21,024 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53942 transitions. Word has length 39 [2019-12-18 16:52:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:21,024 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53942 transitions. [2019-12-18 16:52:21,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:52:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53942 transitions. [2019-12-18 16:52:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:52:21,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:21,043 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 16:52:21,043 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 16:52:21,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:21,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-18 16:52:21,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:21,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585397549] [2019-12-18 16:52:21,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:21,116 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 16:52:21,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585397549] [2019-12-18 16:52:21,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:21,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:52:21,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695331784] [2019-12-18 16:52:21,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:52:21,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:21,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:52:21,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:52:21,118 INFO L87 Difference]: Start difference. First operand 17641 states and 53942 transitions. Second operand 5 states. [2019-12-18 16:52:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:21,720 INFO L93 Difference]: Finished difference Result 25346 states and 76624 transitions. [2019-12-18 16:52:21,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:52:21,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:52:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:21,758 INFO L225 Difference]: With dead ends: 25346 [2019-12-18 16:52:21,758 INFO L226 Difference]: Without dead ends: 25346 [2019-12-18 16:52:21,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:52:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-18 16:52:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23548. [2019-12-18 16:52:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23548 states. [2019-12-18 16:52:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23548 states to 23548 states and 71702 transitions. [2019-12-18 16:52:22,281 INFO L78 Accepts]: Start accepts. Automaton has 23548 states and 71702 transitions. Word has length 40 [2019-12-18 16:52:22,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:22,281 INFO L462 AbstractCegarLoop]: Abstraction has 23548 states and 71702 transitions. [2019-12-18 16:52:22,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:52:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23548 states and 71702 transitions. [2019-12-18 16:52:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:52:22,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:22,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:22,318 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 16:52:22,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:22,318 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-18 16:52:22,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:22,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713982723] [2019-12-18 16:52:22,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:22,388 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 16:52:22,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713982723] [2019-12-18 16:52:22,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:22,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:52:22,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639128428] [2019-12-18 16:52:22,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:52:22,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:22,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:52:22,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:52:22,390 INFO L87 Difference]: Start difference. First operand 23548 states and 71702 transitions. Second operand 5 states. [2019-12-18 16:52:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:22,505 INFO L93 Difference]: Finished difference Result 22163 states and 68469 transitions. [2019-12-18 16:52:22,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:52:22,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:52:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:22,546 INFO L225 Difference]: With dead ends: 22163 [2019-12-18 16:52:22,547 INFO L226 Difference]: Without dead ends: 22163 [2019-12-18 16:52:22,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:52:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22163 states. [2019-12-18 16:52:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22163 to 21239. [2019-12-18 16:52:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21239 states. [2019-12-18 16:52:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21239 states to 21239 states and 65976 transitions. [2019-12-18 16:52:23,076 INFO L78 Accepts]: Start accepts. Automaton has 21239 states and 65976 transitions. Word has length 40 [2019-12-18 16:52:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:23,076 INFO L462 AbstractCegarLoop]: Abstraction has 21239 states and 65976 transitions. [2019-12-18 16:52:23,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:52:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 21239 states and 65976 transitions. [2019-12-18 16:52:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:23,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:23,107 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] [2019-12-18 16:52:23,108 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 16:52:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:23,108 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-18 16:52:23,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:23,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240237345] [2019-12-18 16:52:23,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:23,191 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 16:52:23,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240237345] [2019-12-18 16:52:23,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:23,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:52:23,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996608300] [2019-12-18 16:52:23,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:23,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:23,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:23,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:23,194 INFO L87 Difference]: Start difference. First operand 21239 states and 65976 transitions. Second operand 7 states. [2019-12-18 16:52:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:23,744 INFO L93 Difference]: Finished difference Result 61984 states and 191507 transitions. [2019-12-18 16:52:23,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 16:52:23,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:52:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:23,816 INFO L225 Difference]: With dead ends: 61984 [2019-12-18 16:52:23,816 INFO L226 Difference]: Without dead ends: 47427 [2019-12-18 16:52:23,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:52:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47427 states. [2019-12-18 16:52:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47427 to 24800. [2019-12-18 16:52:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24800 states. [2019-12-18 16:52:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24800 states to 24800 states and 77549 transitions. [2019-12-18 16:52:24,371 INFO L78 Accepts]: Start accepts. Automaton has 24800 states and 77549 transitions. Word has length 63 [2019-12-18 16:52:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:24,372 INFO L462 AbstractCegarLoop]: Abstraction has 24800 states and 77549 transitions. [2019-12-18 16:52:24,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 24800 states and 77549 transitions. [2019-12-18 16:52:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:24,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:24,402 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] [2019-12-18 16:52:24,402 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 16:52:24,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:24,402 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-18 16:52:24,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:24,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163565681] [2019-12-18 16:52:24,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:24,491 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 16:52:24,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163565681] [2019-12-18 16:52:24,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:24,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:52:24,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480363023] [2019-12-18 16:52:24,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:24,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:24,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:24,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:24,493 INFO L87 Difference]: Start difference. First operand 24800 states and 77549 transitions. Second operand 7 states. [2019-12-18 16:52:25,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:25,240 INFO L93 Difference]: Finished difference Result 68216 states and 209466 transitions. [2019-12-18 16:52:25,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:52:25,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:52:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:25,339 INFO L225 Difference]: With dead ends: 68216 [2019-12-18 16:52:25,339 INFO L226 Difference]: Without dead ends: 48323 [2019-12-18 16:52:25,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:52:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48323 states. [2019-12-18 16:52:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48323 to 28643. [2019-12-18 16:52:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28643 states. [2019-12-18 16:52:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28643 states to 28643 states and 89209 transitions. [2019-12-18 16:52:25,941 INFO L78 Accepts]: Start accepts. Automaton has 28643 states and 89209 transitions. Word has length 63 [2019-12-18 16:52:25,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:25,941 INFO L462 AbstractCegarLoop]: Abstraction has 28643 states and 89209 transitions. [2019-12-18 16:52:25,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 28643 states and 89209 transitions. [2019-12-18 16:52:25,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:25,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:25,973 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] [2019-12-18 16:52:25,973 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 16:52:25,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:25,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-18 16:52:25,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:25,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202687610] [2019-12-18 16:52:25,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:26,064 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 16:52:26,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202687610] [2019-12-18 16:52:26,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:26,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:52:26,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939474237] [2019-12-18 16:52:26,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:26,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:26,066 INFO L87 Difference]: Start difference. First operand 28643 states and 89209 transitions. Second operand 7 states. [2019-12-18 16:52:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:26,777 INFO L93 Difference]: Finished difference Result 59688 states and 183263 transitions. [2019-12-18 16:52:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:52:26,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:52:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:26,889 INFO L225 Difference]: With dead ends: 59688 [2019-12-18 16:52:26,889 INFO L226 Difference]: Without dead ends: 52607 [2019-12-18 16:52:26,890 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 16:52:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52607 states. [2019-12-18 16:52:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52607 to 28951. [2019-12-18 16:52:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28951 states. [2019-12-18 16:52:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28951 states to 28951 states and 90160 transitions. [2019-12-18 16:52:27,552 INFO L78 Accepts]: Start accepts. Automaton has 28951 states and 90160 transitions. Word has length 63 [2019-12-18 16:52:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:27,553 INFO L462 AbstractCegarLoop]: Abstraction has 28951 states and 90160 transitions. [2019-12-18 16:52:27,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 28951 states and 90160 transitions. [2019-12-18 16:52:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:27,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:27,584 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] [2019-12-18 16:52:27,584 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 16:52:27,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-18 16:52:27,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:27,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330898941] [2019-12-18 16:52:27,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:27,981 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 16:52:27,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330898941] [2019-12-18 16:52:27,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:27,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:52:27,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969050340] [2019-12-18 16:52:27,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:27,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:27,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:27,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:27,983 INFO L87 Difference]: Start difference. First operand 28951 states and 90160 transitions. Second operand 7 states. [2019-12-18 16:52:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:29,068 INFO L93 Difference]: Finished difference Result 37939 states and 115796 transitions. [2019-12-18 16:52:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:52:29,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:52:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:29,123 INFO L225 Difference]: With dead ends: 37939 [2019-12-18 16:52:29,123 INFO L226 Difference]: Without dead ends: 37715 [2019-12-18 16:52:29,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:52:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37715 states. [2019-12-18 16:52:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37715 to 31739. [2019-12-18 16:52:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31739 states. [2019-12-18 16:52:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31739 states to 31739 states and 98459 transitions. [2019-12-18 16:52:29,653 INFO L78 Accepts]: Start accepts. Automaton has 31739 states and 98459 transitions. Word has length 63 [2019-12-18 16:52:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:29,654 INFO L462 AbstractCegarLoop]: Abstraction has 31739 states and 98459 transitions. [2019-12-18 16:52:29,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand 31739 states and 98459 transitions. [2019-12-18 16:52:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:29,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:29,700 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] [2019-12-18 16:52:29,700 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 16:52:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:29,700 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-18 16:52:29,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:29,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700790121] [2019-12-18 16:52:29,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:29,803 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 16:52:29,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700790121] [2019-12-18 16:52:29,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:29,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:52:29,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283375155] [2019-12-18 16:52:29,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:52:29,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:29,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:52:29,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:52:29,807 INFO L87 Difference]: Start difference. First operand 31739 states and 98459 transitions. Second operand 8 states. [2019-12-18 16:52:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:31,699 INFO L93 Difference]: Finished difference Result 54763 states and 166102 transitions. [2019-12-18 16:52:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 16:52:31,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 16:52:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:31,789 INFO L225 Difference]: With dead ends: 54763 [2019-12-18 16:52:31,790 INFO L226 Difference]: Without dead ends: 54440 [2019-12-18 16:52:31,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:52:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54440 states. [2019-12-18 16:52:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54440 to 34490. [2019-12-18 16:52:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34490 states. [2019-12-18 16:52:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34490 states to 34490 states and 107254 transitions. [2019-12-18 16:52:32,805 INFO L78 Accepts]: Start accepts. Automaton has 34490 states and 107254 transitions. Word has length 63 [2019-12-18 16:52:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:32,805 INFO L462 AbstractCegarLoop]: Abstraction has 34490 states and 107254 transitions. [2019-12-18 16:52:32,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:52:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand 34490 states and 107254 transitions. [2019-12-18 16:52:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:32,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:32,846 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] [2019-12-18 16:52:32,846 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 16:52:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:32,846 INFO L82 PathProgramCache]: Analyzing trace with hash 908177687, now seen corresponding path program 6 times [2019-12-18 16:52:32,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:32,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299898244] [2019-12-18 16:52:32,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:32,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 16:52:32,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299898244] [2019-12-18 16:52:32,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:32,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:52:32,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911903733] [2019-12-18 16:52:32,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:32,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:32,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:32,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:32,948 INFO L87 Difference]: Start difference. First operand 34490 states and 107254 transitions. Second operand 7 states. [2019-12-18 16:52:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:33,916 INFO L93 Difference]: Finished difference Result 56839 states and 174213 transitions. [2019-12-18 16:52:33,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:52:33,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:52:33,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:34,004 INFO L225 Difference]: With dead ends: 56839 [2019-12-18 16:52:34,004 INFO L226 Difference]: Without dead ends: 56619 [2019-12-18 16:52:34,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:52:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56619 states. [2019-12-18 16:52:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56619 to 40204. [2019-12-18 16:52:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40204 states. [2019-12-18 16:52:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40204 states to 40204 states and 124731 transitions. [2019-12-18 16:52:34,758 INFO L78 Accepts]: Start accepts. Automaton has 40204 states and 124731 transitions. Word has length 63 [2019-12-18 16:52:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:34,759 INFO L462 AbstractCegarLoop]: Abstraction has 40204 states and 124731 transitions. [2019-12-18 16:52:34,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 40204 states and 124731 transitions. [2019-12-18 16:52:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:34,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:34,805 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] [2019-12-18 16:52:34,805 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 16:52:34,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:34,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1577046585, now seen corresponding path program 7 times [2019-12-18 16:52:34,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:34,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332457634] [2019-12-18 16:52:34,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:34,935 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 16:52:34,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332457634] [2019-12-18 16:52:34,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:34,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:52:34,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697100665] [2019-12-18 16:52:34,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:52:34,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:34,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:52:34,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:34,938 INFO L87 Difference]: Start difference. First operand 40204 states and 124731 transitions. Second operand 9 states. [2019-12-18 16:52:36,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:36,152 INFO L93 Difference]: Finished difference Result 59538 states and 181994 transitions. [2019-12-18 16:52:36,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:52:36,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 16:52:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:36,254 INFO L225 Difference]: With dead ends: 59538 [2019-12-18 16:52:36,254 INFO L226 Difference]: Without dead ends: 59286 [2019-12-18 16:52:36,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-18 16:52:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59286 states. [2019-12-18 16:52:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59286 to 40146. [2019-12-18 16:52:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40146 states. [2019-12-18 16:52:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40146 states to 40146 states and 124568 transitions. [2019-12-18 16:52:37,352 INFO L78 Accepts]: Start accepts. Automaton has 40146 states and 124568 transitions. Word has length 63 [2019-12-18 16:52:37,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:37,352 INFO L462 AbstractCegarLoop]: Abstraction has 40146 states and 124568 transitions. [2019-12-18 16:52:37,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:52:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 40146 states and 124568 transitions. [2019-12-18 16:52:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:37,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:37,400 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] [2019-12-18 16:52:37,400 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 16:52:37,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:37,401 INFO L82 PathProgramCache]: Analyzing trace with hash 593914995, now seen corresponding path program 8 times [2019-12-18 16:52:37,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:37,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477285799] [2019-12-18 16:52:37,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:37,594 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 16:52:37,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477285799] [2019-12-18 16:52:37,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:37,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 16:52:37,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051035242] [2019-12-18 16:52:37,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:52:37,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:37,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:52:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:52:37,597 INFO L87 Difference]: Start difference. First operand 40146 states and 124568 transitions. Second operand 12 states. [2019-12-18 16:52:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:40,175 INFO L93 Difference]: Finished difference Result 63234 states and 190688 transitions. [2019-12-18 16:52:40,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 16:52:40,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-18 16:52:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:40,319 INFO L225 Difference]: With dead ends: 63234 [2019-12-18 16:52:40,319 INFO L226 Difference]: Without dead ends: 63234 [2019-12-18 16:52:40,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:52:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63234 states. [2019-12-18 16:52:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63234 to 40541. [2019-12-18 16:52:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40541 states. [2019-12-18 16:52:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40541 states to 40541 states and 125141 transitions. [2019-12-18 16:52:41,634 INFO L78 Accepts]: Start accepts. Automaton has 40541 states and 125141 transitions. Word has length 63 [2019-12-18 16:52:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:41,635 INFO L462 AbstractCegarLoop]: Abstraction has 40541 states and 125141 transitions. [2019-12-18 16:52:41,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:52:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 40541 states and 125141 transitions. [2019-12-18 16:52:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:41,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:41,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:52:41,687 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 16:52:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash 194134925, now seen corresponding path program 9 times [2019-12-18 16:52:41,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:41,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267468543] [2019-12-18 16:52:41,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:41,815 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 16:52:41,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267468543] [2019-12-18 16:52:41,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:41,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:52:41,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175755550] [2019-12-18 16:52:41,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:52:41,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:41,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:52:41,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:41,818 INFO L87 Difference]: Start difference. First operand 40541 states and 125141 transitions. Second operand 9 states. [2019-12-18 16:52:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:42,892 INFO L93 Difference]: Finished difference Result 56324 states and 171972 transitions. [2019-12-18 16:52:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 16:52:42,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 16:52:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:42,985 INFO L225 Difference]: With dead ends: 56324 [2019-12-18 16:52:42,985 INFO L226 Difference]: Without dead ends: 56324 [2019-12-18 16:52:42,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:52:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56324 states. [2019-12-18 16:52:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56324 to 39891. [2019-12-18 16:52:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39891 states. [2019-12-18 16:52:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39891 states to 39891 states and 123148 transitions. [2019-12-18 16:52:43,754 INFO L78 Accepts]: Start accepts. Automaton has 39891 states and 123148 transitions. Word has length 63 [2019-12-18 16:52:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:43,755 INFO L462 AbstractCegarLoop]: Abstraction has 39891 states and 123148 transitions. [2019-12-18 16:52:43,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:52:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 39891 states and 123148 transitions. [2019-12-18 16:52:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:43,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:43,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:43,798 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:43,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1930988027, now seen corresponding path program 10 times [2019-12-18 16:52:43,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:43,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636381451] [2019-12-18 16:52:43,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:43,920 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 16:52:43,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636381451] [2019-12-18 16:52:43,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:43,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:52:43,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945009250] [2019-12-18 16:52:43,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:52:43,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:43,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:52:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:43,922 INFO L87 Difference]: Start difference. First operand 39891 states and 123148 transitions. Second operand 9 states. [2019-12-18 16:52:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:45,353 INFO L93 Difference]: Finished difference Result 57172 states and 174572 transitions. [2019-12-18 16:52:45,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:52:45,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 16:52:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:45,439 INFO L225 Difference]: With dead ends: 57172 [2019-12-18 16:52:45,440 INFO L226 Difference]: Without dead ends: 57172 [2019-12-18 16:52:45,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2019-12-18 16:52:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57172 states. [2019-12-18 16:52:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57172 to 37628. [2019-12-18 16:52:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37628 states. [2019-12-18 16:52:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37628 states to 37628 states and 116395 transitions. [2019-12-18 16:52:46,514 INFO L78 Accepts]: Start accepts. Automaton has 37628 states and 116395 transitions. Word has length 63 [2019-12-18 16:52:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:46,515 INFO L462 AbstractCegarLoop]: Abstraction has 37628 states and 116395 transitions. [2019-12-18 16:52:46,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:52:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 37628 states and 116395 transitions. [2019-12-18 16:52:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:46,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:46,560 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] [2019-12-18 16:52:46,561 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 16:52:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1638823163, now seen corresponding path program 11 times [2019-12-18 16:52:46,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:46,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348485141] [2019-12-18 16:52:46,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:46,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 16:52:46,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348485141] [2019-12-18 16:52:46,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:46,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:52:46,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794512090] [2019-12-18 16:52:46,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:46,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:46,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:46,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:46,655 INFO L87 Difference]: Start difference. First operand 37628 states and 116395 transitions. Second operand 7 states. [2019-12-18 16:52:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:47,423 INFO L93 Difference]: Finished difference Result 58927 states and 179572 transitions. [2019-12-18 16:52:47,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:52:47,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:52:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:47,513 INFO L225 Difference]: With dead ends: 58927 [2019-12-18 16:52:47,513 INFO L226 Difference]: Without dead ends: 58927 [2019-12-18 16:52:47,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:52:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58927 states. [2019-12-18 16:52:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58927 to 39590. [2019-12-18 16:52:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39590 states. [2019-12-18 16:52:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39590 states to 39590 states and 122412 transitions. [2019-12-18 16:52:48,244 INFO L78 Accepts]: Start accepts. Automaton has 39590 states and 122412 transitions. Word has length 63 [2019-12-18 16:52:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:48,244 INFO L462 AbstractCegarLoop]: Abstraction has 39590 states and 122412 transitions. [2019-12-18 16:52:48,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 39590 states and 122412 transitions. [2019-12-18 16:52:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:48,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:48,287 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] [2019-12-18 16:52:48,287 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 16:52:48,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1952090881, now seen corresponding path program 12 times [2019-12-18 16:52:48,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:48,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493727334] [2019-12-18 16:52:48,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:48,398 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 16:52:48,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493727334] [2019-12-18 16:52:48,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:48,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:52:48,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308562045] [2019-12-18 16:52:48,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:52:48,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:48,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:52:48,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:52:48,400 INFO L87 Difference]: Start difference. First operand 39590 states and 122412 transitions. Second operand 8 states. [2019-12-18 16:52:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:49,396 INFO L93 Difference]: Finished difference Result 58424 states and 178152 transitions. [2019-12-18 16:52:49,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:52:49,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 16:52:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:49,488 INFO L225 Difference]: With dead ends: 58424 [2019-12-18 16:52:49,488 INFO L226 Difference]: Without dead ends: 58424 [2019-12-18 16:52:49,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:52:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58424 states. [2019-12-18 16:52:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58424 to 38167. [2019-12-18 16:52:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38167 states. [2019-12-18 16:52:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38167 states to 38167 states and 118136 transitions. [2019-12-18 16:52:50,520 INFO L78 Accepts]: Start accepts. Automaton has 38167 states and 118136 transitions. Word has length 63 [2019-12-18 16:52:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:50,520 INFO L462 AbstractCegarLoop]: Abstraction has 38167 states and 118136 transitions. [2019-12-18 16:52:50,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:52:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 38167 states and 118136 transitions. [2019-12-18 16:52:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:50,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:50,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, 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 16:52:50,565 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 16:52:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1981956519, now seen corresponding path program 13 times [2019-12-18 16:52:50,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:50,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536673610] [2019-12-18 16:52:50,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:50,714 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 16:52:50,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536673610] [2019-12-18 16:52:50,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:50,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:52:50,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539215336] [2019-12-18 16:52:50,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:52:50,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:50,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:52:50,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:52:50,716 INFO L87 Difference]: Start difference. First operand 38167 states and 118136 transitions. Second operand 9 states. [2019-12-18 16:52:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:52,355 INFO L93 Difference]: Finished difference Result 62191 states and 187556 transitions. [2019-12-18 16:52:52,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:52:52,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 16:52:52,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:52,448 INFO L225 Difference]: With dead ends: 62191 [2019-12-18 16:52:52,448 INFO L226 Difference]: Without dead ends: 62191 [2019-12-18 16:52:52,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-12-18 16:52:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62191 states. [2019-12-18 16:52:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62191 to 38551. [2019-12-18 16:52:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38551 states. [2019-12-18 16:52:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38551 states to 38551 states and 119476 transitions. [2019-12-18 16:52:53,235 INFO L78 Accepts]: Start accepts. Automaton has 38551 states and 119476 transitions. Word has length 63 [2019-12-18 16:52:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:53,236 INFO L462 AbstractCegarLoop]: Abstraction has 38551 states and 119476 transitions. [2019-12-18 16:52:53,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:52:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 38551 states and 119476 transitions. [2019-12-18 16:52:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:53,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:53,277 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] [2019-12-18 16:52:53,277 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 16:52:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1745238685, now seen corresponding path program 14 times [2019-12-18 16:52:53,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:53,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952139750] [2019-12-18 16:52:53,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:53,393 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 16:52:53,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952139750] [2019-12-18 16:52:53,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:53,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:52:53,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521087048] [2019-12-18 16:52:53,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:52:53,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:53,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:52:53,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:52:53,394 INFO L87 Difference]: Start difference. First operand 38551 states and 119476 transitions. Second operand 8 states. [2019-12-18 16:52:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:54,779 INFO L93 Difference]: Finished difference Result 52611 states and 161018 transitions. [2019-12-18 16:52:54,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:52:54,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 16:52:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:54,856 INFO L225 Difference]: With dead ends: 52611 [2019-12-18 16:52:54,857 INFO L226 Difference]: Without dead ends: 52555 [2019-12-18 16:52:54,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:52:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52555 states. [2019-12-18 16:52:55,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52555 to 37811. [2019-12-18 16:52:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37811 states. [2019-12-18 16:52:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37811 states to 37811 states and 116442 transitions. [2019-12-18 16:52:55,506 INFO L78 Accepts]: Start accepts. Automaton has 37811 states and 116442 transitions. Word has length 63 [2019-12-18 16:52:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:55,506 INFO L462 AbstractCegarLoop]: Abstraction has 37811 states and 116442 transitions. [2019-12-18 16:52:55,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:52:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 37811 states and 116442 transitions. [2019-12-18 16:52:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:55,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:55,545 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] [2019-12-18 16:52:55,545 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 16:52:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:55,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1876409601, now seen corresponding path program 15 times [2019-12-18 16:52:55,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:55,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104478298] [2019-12-18 16:52:55,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:55,639 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 16:52:55,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104478298] [2019-12-18 16:52:55,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:55,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:52:55,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923159569] [2019-12-18 16:52:55,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:52:55,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:55,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:52:55,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:52:55,641 INFO L87 Difference]: Start difference. First operand 37811 states and 116442 transitions. Second operand 7 states. [2019-12-18 16:52:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:56,778 INFO L93 Difference]: Finished difference Result 56819 states and 173690 transitions. [2019-12-18 16:52:56,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 16:52:56,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:52:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:56,864 INFO L225 Difference]: With dead ends: 56819 [2019-12-18 16:52:56,864 INFO L226 Difference]: Without dead ends: 56819 [2019-12-18 16:52:56,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:52:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56819 states. [2019-12-18 16:52:57,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56819 to 39967. [2019-12-18 16:52:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39967 states. [2019-12-18 16:52:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39967 states to 39967 states and 123360 transitions. [2019-12-18 16:52:57,599 INFO L78 Accepts]: Start accepts. Automaton has 39967 states and 123360 transitions. Word has length 63 [2019-12-18 16:52:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:57,599 INFO L462 AbstractCegarLoop]: Abstraction has 39967 states and 123360 transitions. [2019-12-18 16:52:57,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:52:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 39967 states and 123360 transitions. [2019-12-18 16:52:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:57,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:57,644 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] [2019-12-18 16:52:57,644 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 16:52:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:57,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1937295543, now seen corresponding path program 16 times [2019-12-18 16:52:57,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:57,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654391172] [2019-12-18 16:52:57,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:57,739 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 16:52:57,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654391172] [2019-12-18 16:52:57,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:57,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:52:57,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019898288] [2019-12-18 16:52:57,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:52:57,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:57,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:52:57,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:52:57,741 INFO L87 Difference]: Start difference. First operand 39967 states and 123360 transitions. Second operand 8 states. [2019-12-18 16:52:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:59,043 INFO L93 Difference]: Finished difference Result 61151 states and 186193 transitions. [2019-12-18 16:52:59,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:52:59,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 16:52:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:59,143 INFO L225 Difference]: With dead ends: 61151 [2019-12-18 16:52:59,143 INFO L226 Difference]: Without dead ends: 61151 [2019-12-18 16:52:59,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:52:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61151 states. [2019-12-18 16:52:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61151 to 40769. [2019-12-18 16:52:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40769 states. [2019-12-18 16:52:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40769 states to 40769 states and 125649 transitions. [2019-12-18 16:52:59,942 INFO L78 Accepts]: Start accepts. Automaton has 40769 states and 125649 transitions. Word has length 63 [2019-12-18 16:52:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:59,942 INFO L462 AbstractCegarLoop]: Abstraction has 40769 states and 125649 transitions. [2019-12-18 16:52:59,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:52:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 40769 states and 125649 transitions. [2019-12-18 16:52:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:52:59,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:59,991 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] [2019-12-18 16:52:59,991 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 16:52:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1351537083, now seen corresponding path program 17 times [2019-12-18 16:52:59,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:59,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775072495] [2019-12-18 16:52:59,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:00,112 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 16:53:00,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775072495] [2019-12-18 16:53:00,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:00,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:53:00,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707017179] [2019-12-18 16:53:00,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:53:00,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:53:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:53:00,114 INFO L87 Difference]: Start difference. First operand 40769 states and 125649 transitions. Second operand 9 states. [2019-12-18 16:53:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:01,411 INFO L93 Difference]: Finished difference Result 61212 states and 186346 transitions. [2019-12-18 16:53:01,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:53:01,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-18 16:53:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:01,505 INFO L225 Difference]: With dead ends: 61212 [2019-12-18 16:53:01,505 INFO L226 Difference]: Without dead ends: 61212 [2019-12-18 16:53:01,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:53:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61212 states. [2019-12-18 16:53:02,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61212 to 39663. [2019-12-18 16:53:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39663 states. [2019-12-18 16:53:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39663 states to 39663 states and 122479 transitions. [2019-12-18 16:53:02,775 INFO L78 Accepts]: Start accepts. Automaton has 39663 states and 122479 transitions. Word has length 63 [2019-12-18 16:53:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:02,775 INFO L462 AbstractCegarLoop]: Abstraction has 39663 states and 122479 transitions. [2019-12-18 16:53:02,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:53:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 39663 states and 122479 transitions. [2019-12-18 16:53:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:53:02,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:02,821 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] [2019-12-18 16:53:02,821 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 16:53:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1012741715, now seen corresponding path program 18 times [2019-12-18 16:53:02,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:02,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710800580] [2019-12-18 16:53:02,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:02,874 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 16:53:02,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710800580] [2019-12-18 16:53:02,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:02,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:53:02,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208274133] [2019-12-18 16:53:02,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:53:02,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:02,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:53:02,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:02,876 INFO L87 Difference]: Start difference. First operand 39663 states and 122479 transitions. Second operand 3 states. [2019-12-18 16:53:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:03,027 INFO L93 Difference]: Finished difference Result 39662 states and 122477 transitions. [2019-12-18 16:53:03,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:53:03,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-18 16:53:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:03,087 INFO L225 Difference]: With dead ends: 39662 [2019-12-18 16:53:03,087 INFO L226 Difference]: Without dead ends: 39662 [2019-12-18 16:53:03,088 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 16:53:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39662 states. [2019-12-18 16:53:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39662 to 32320. [2019-12-18 16:53:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32320 states. [2019-12-18 16:53:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32320 states to 32320 states and 100616 transitions. [2019-12-18 16:53:03,651 INFO L78 Accepts]: Start accepts. Automaton has 32320 states and 100616 transitions. Word has length 63 [2019-12-18 16:53:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:03,651 INFO L462 AbstractCegarLoop]: Abstraction has 32320 states and 100616 transitions. [2019-12-18 16:53:03,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:53:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 32320 states and 100616 transitions. [2019-12-18 16:53:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:53:03,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:03,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:53:03,687 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:03,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:03,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-18 16:53:03,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:03,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324613482] [2019-12-18 16:53:03,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:03,739 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 16:53:03,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324613482] [2019-12-18 16:53:03,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:03,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:53:03,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454279483] [2019-12-18 16:53:03,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:53:03,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:53:03,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:03,741 INFO L87 Difference]: Start difference. First operand 32320 states and 100616 transitions. Second operand 3 states. [2019-12-18 16:53:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:03,845 INFO L93 Difference]: Finished difference Result 24829 states and 76487 transitions. [2019-12-18 16:53:03,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:53:03,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:53:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:03,893 INFO L225 Difference]: With dead ends: 24829 [2019-12-18 16:53:03,893 INFO L226 Difference]: Without dead ends: 24829 [2019-12-18 16:53:03,894 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 16:53:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24829 states. [2019-12-18 16:53:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24829 to 23073. [2019-12-18 16:53:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23073 states. [2019-12-18 16:53:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23073 states to 23073 states and 71005 transitions. [2019-12-18 16:53:04,251 INFO L78 Accepts]: Start accepts. Automaton has 23073 states and 71005 transitions. Word has length 64 [2019-12-18 16:53:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:04,252 INFO L462 AbstractCegarLoop]: Abstraction has 23073 states and 71005 transitions. [2019-12-18 16:53:04,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:53:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 23073 states and 71005 transitions. [2019-12-18 16:53:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:53:04,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:04,279 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 16:53:04,279 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:04,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:04,280 INFO L82 PathProgramCache]: Analyzing trace with hash -668679299, now seen corresponding path program 1 times [2019-12-18 16:53:04,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:04,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495005222] [2019-12-18 16:53:04,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:04,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495005222] [2019-12-18 16:53:04,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:04,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:53:04,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471153426] [2019-12-18 16:53:04,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:53:04,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:04,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:53:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:53:04,357 INFO L87 Difference]: Start difference. First operand 23073 states and 71005 transitions. Second operand 6 states. [2019-12-18 16:53:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:05,224 INFO L93 Difference]: Finished difference Result 32013 states and 97239 transitions. [2019-12-18 16:53:05,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:53:05,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 16:53:05,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:05,269 INFO L225 Difference]: With dead ends: 32013 [2019-12-18 16:53:05,269 INFO L226 Difference]: Without dead ends: 32013 [2019-12-18 16:53:05,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:53:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32013 states. [2019-12-18 16:53:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32013 to 24289. [2019-12-18 16:53:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24289 states. [2019-12-18 16:53:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24289 states to 24289 states and 74657 transitions. [2019-12-18 16:53:05,690 INFO L78 Accepts]: Start accepts. Automaton has 24289 states and 74657 transitions. Word has length 65 [2019-12-18 16:53:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:05,690 INFO L462 AbstractCegarLoop]: Abstraction has 24289 states and 74657 transitions. [2019-12-18 16:53:05,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:53:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 24289 states and 74657 transitions. [2019-12-18 16:53:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:53:05,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:05,718 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 16:53:05,718 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:05,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:05,718 INFO L82 PathProgramCache]: Analyzing trace with hash 339295601, now seen corresponding path program 2 times [2019-12-18 16:53:05,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:05,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765036454] [2019-12-18 16:53:05,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:05,913 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 16:53:05,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765036454] [2019-12-18 16:53:05,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:05,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:53:05,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285275701] [2019-12-18 16:53:05,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:53:05,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:05,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:53:05,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:53:05,915 INFO L87 Difference]: Start difference. First operand 24289 states and 74657 transitions. Second operand 11 states. [2019-12-18 16:53:07,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:07,305 INFO L93 Difference]: Finished difference Result 52747 states and 162774 transitions. [2019-12-18 16:53:07,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 16:53:07,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 16:53:07,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:07,380 INFO L225 Difference]: With dead ends: 52747 [2019-12-18 16:53:07,380 INFO L226 Difference]: Without dead ends: 50181 [2019-12-18 16:53:07,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 16:53:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50181 states. [2019-12-18 16:53:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50181 to 29857. [2019-12-18 16:53:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29857 states. [2019-12-18 16:53:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29857 states to 29857 states and 91736 transitions. [2019-12-18 16:53:07,968 INFO L78 Accepts]: Start accepts. Automaton has 29857 states and 91736 transitions. Word has length 65 [2019-12-18 16:53:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:07,968 INFO L462 AbstractCegarLoop]: Abstraction has 29857 states and 91736 transitions. [2019-12-18 16:53:07,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:53:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 29857 states and 91736 transitions. [2019-12-18 16:53:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:53:07,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:07,999 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 16:53:07,999 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:07,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash 51203325, now seen corresponding path program 3 times [2019-12-18 16:53:07,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:07,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397957489] [2019-12-18 16:53:07,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:08,136 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 16:53:08,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397957489] [2019-12-18 16:53:08,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:08,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:53:08,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337095728] [2019-12-18 16:53:08,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:53:08,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:08,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:53:08,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:53:08,137 INFO L87 Difference]: Start difference. First operand 29857 states and 91736 transitions. Second operand 11 states. [2019-12-18 16:53:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:09,277 INFO L93 Difference]: Finished difference Result 51001 states and 155978 transitions. [2019-12-18 16:53:09,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:53:09,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 16:53:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:09,340 INFO L225 Difference]: With dead ends: 51001 [2019-12-18 16:53:09,341 INFO L226 Difference]: Without dead ends: 40450 [2019-12-18 16:53:09,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:53:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40450 states. [2019-12-18 16:53:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40450 to 24125. [2019-12-18 16:53:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24125 states. [2019-12-18 16:53:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24125 states to 24125 states and 73451 transitions. [2019-12-18 16:53:09,814 INFO L78 Accepts]: Start accepts. Automaton has 24125 states and 73451 transitions. Word has length 65 [2019-12-18 16:53:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:09,814 INFO L462 AbstractCegarLoop]: Abstraction has 24125 states and 73451 transitions. [2019-12-18 16:53:09,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:53:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 24125 states and 73451 transitions. [2019-12-18 16:53:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:53:09,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:09,839 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 16:53:09,839 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:09,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1186487875, now seen corresponding path program 4 times [2019-12-18 16:53:09,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:09,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439663901] [2019-12-18 16:53:09,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:10,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439663901] [2019-12-18 16:53:10,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:10,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:53:10,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967907811] [2019-12-18 16:53:10,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:53:10,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:53:10,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:53:10,007 INFO L87 Difference]: Start difference. First operand 24125 states and 73451 transitions. Second operand 12 states. [2019-12-18 16:53:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:11,072 INFO L93 Difference]: Finished difference Result 41052 states and 124781 transitions. [2019-12-18 16:53:11,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:53:11,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-18 16:53:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:11,137 INFO L225 Difference]: With dead ends: 41052 [2019-12-18 16:53:11,137 INFO L226 Difference]: Without dead ends: 39810 [2019-12-18 16:53:11,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 16:53:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39810 states. [2019-12-18 16:53:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39810 to 23277. [2019-12-18 16:53:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23277 states. [2019-12-18 16:53:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23277 states to 23277 states and 71138 transitions. [2019-12-18 16:53:11,786 INFO L78 Accepts]: Start accepts. Automaton has 23277 states and 71138 transitions. Word has length 65 [2019-12-18 16:53:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:11,786 INFO L462 AbstractCegarLoop]: Abstraction has 23277 states and 71138 transitions. [2019-12-18 16:53:11,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:53:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 23277 states and 71138 transitions. [2019-12-18 16:53:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:53:11,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:11,812 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 16:53:11,812 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1019867375, now seen corresponding path program 5 times [2019-12-18 16:53:11,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:11,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038329047] [2019-12-18 16:53:11,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:11,880 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 16:53:11,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038329047] [2019-12-18 16:53:11,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:11,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:53:11,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888594316] [2019-12-18 16:53:11,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:53:11,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:11,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:53:11,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:53:11,882 INFO L87 Difference]: Start difference. First operand 23277 states and 71138 transitions. Second operand 4 states. [2019-12-18 16:53:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:12,040 INFO L93 Difference]: Finished difference Result 28255 states and 86066 transitions. [2019-12-18 16:53:12,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:53:12,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 16:53:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:12,080 INFO L225 Difference]: With dead ends: 28255 [2019-12-18 16:53:12,080 INFO L226 Difference]: Without dead ends: 28255 [2019-12-18 16:53:12,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:53:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28255 states. [2019-12-18 16:53:12,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28255 to 23446. [2019-12-18 16:53:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23446 states. [2019-12-18 16:53:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23446 states to 23446 states and 71901 transitions. [2019-12-18 16:53:12,487 INFO L78 Accepts]: Start accepts. Automaton has 23446 states and 71901 transitions. Word has length 65 [2019-12-18 16:53:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:12,487 INFO L462 AbstractCegarLoop]: Abstraction has 23446 states and 71901 transitions. [2019-12-18 16:53:12,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:53:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 23446 states and 71901 transitions. [2019-12-18 16:53:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:53:12,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:12,518 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 16:53:12,518 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:12,518 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 1 times [2019-12-18 16:53:12,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:12,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118066242] [2019-12-18 16:53:12,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:53:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:53:12,631 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:53:12,632 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:53:12,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= 0 |v_ULTIMATE.start_main_~#t657~0.offset_16|) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t657~0.base_22|) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t657~0.base_22| 4)) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t657~0.base_22| 1) |v_#valid_69|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t657~0.base_22|)) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t657~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t657~0.base_22|) |v_ULTIMATE.start_main_~#t657~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t658~0.offset=|v_ULTIMATE.start_main_~#t658~0.offset_14|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, ULTIMATE.start_main_~#t659~0.base=|v_ULTIMATE.start_main_~#t659~0.base_17|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_~#t658~0.base=|v_ULTIMATE.start_main_~#t658~0.base_19|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, ULTIMATE.start_main_~#t657~0.base=|v_ULTIMATE.start_main_~#t657~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t657~0.offset=|v_ULTIMATE.start_main_~#t657~0.offset_16|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ULTIMATE.start_main_~#t659~0.offset=|v_ULTIMATE.start_main_~#t659~0.offset_14|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t658~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t659~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t658~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t657~0.base, ULTIMATE.start_main_~#t657~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t659~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:53:12,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:53:12,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t658~0.base_11| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t658~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t658~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t658~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t658~0.base_11|) |v_ULTIMATE.start_main_~#t658~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t658~0.base_11| 1) |v_#valid_31|) (= 0 |v_ULTIMATE.start_main_~#t658~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t658~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t658~0.offset=|v_ULTIMATE.start_main_~#t658~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t658~0.base=|v_ULTIMATE.start_main_~#t658~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t658~0.offset, ULTIMATE.start_main_~#t658~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 16:53:12,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t659~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t659~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t659~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t659~0.base_12|) |v_ULTIMATE.start_main_~#t659~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t659~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t659~0.base_12| 0)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t659~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t659~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t659~0.offset=|v_ULTIMATE.start_main_~#t659~0.offset_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t659~0.base=|v_ULTIMATE.start_main_~#t659~0.base_12|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t659~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t659~0.base, #length] because there is no mapped edge [2019-12-18 16:53:12,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1745783145 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1745783145 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out-1745783145| |P1Thread1of1ForFork2_#t~ite9_Out-1745783145|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1745783145| ~z~0_In-1745783145) .cse0 (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1745783145| ~z$w_buff1~0_In-1745783145) (not .cse1) (not .cse2) .cse0))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1745783145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1745783145, ~z$w_buff1~0=~z$w_buff1~0_In-1745783145, ~z~0=~z~0_In-1745783145} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1745783145|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1745783145, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1745783145|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1745783145, ~z$w_buff1~0=~z$w_buff1~0_In-1745783145, ~z~0=~z~0_In-1745783145} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 16:53:12,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1575635864 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out-1575635864| ~z$w_buff1~0_In-1575635864) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1575635864 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1575635864 256))) (= 0 (mod ~z$w_buff0_used~0_In-1575635864 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1575635864 256))))) (= |P2Thread1of1ForFork0_#t~ite24_Out-1575635864| |P2Thread1of1ForFork0_#t~ite23_Out-1575635864|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite23_In-1575635864| |P2Thread1of1ForFork0_#t~ite23_Out-1575635864|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite24_Out-1575635864| ~z$w_buff1~0_In-1575635864)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1575635864, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1575635864, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1575635864|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1575635864, ~z$w_buff1~0=~z$w_buff1~0_In-1575635864, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1575635864, ~weak$$choice2~0=~weak$$choice2~0_In-1575635864} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1575635864, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1575635864|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1575635864, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1575635864|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1575635864, ~z$w_buff1~0=~z$w_buff1~0_In-1575635864, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1575635864, ~weak$$choice2~0=~weak$$choice2~0_In-1575635864} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 16:53:12,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-267354685 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-267354685 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-267354685 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In-267354685 256))) (.cse5 (= |P2Thread1of1ForFork0_#t~ite30_Out-267354685| |P2Thread1of1ForFork0_#t~ite29_Out-267354685|)) (.cse4 (= 0 (mod ~weak$$choice2~0_In-267354685 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-267354685| 0) (or (not .cse2) .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-267354685| |P2Thread1of1ForFork0_#t~ite29_Out-267354685|) (not .cse3) .cse4 .cse5)) (and (or (and (or (and .cse0 .cse6) .cse3 (and .cse2 .cse6)) (= ~z$w_buff1_used~0_In-267354685 |P2Thread1of1ForFork0_#t~ite29_Out-267354685|) .cse4 .cse5) (and (= |P2Thread1of1ForFork0_#t~ite29_In-267354685| |P2Thread1of1ForFork0_#t~ite29_Out-267354685|) (not .cse4) (= ~z$w_buff1_used~0_In-267354685 |P2Thread1of1ForFork0_#t~ite30_Out-267354685|))) (= |P2Thread1of1ForFork0_#t~ite28_In-267354685| |P2Thread1of1ForFork0_#t~ite28_Out-267354685|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-267354685|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-267354685, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-267354685, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-267354685, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-267354685, ~weak$$choice2~0=~weak$$choice2~0_In-267354685, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-267354685|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-267354685|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-267354685, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-267354685, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-267354685, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-267354685, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-267354685|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-267354685|, ~weak$$choice2~0=~weak$$choice2~0_In-267354685} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:53:12,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:53:12,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 16:53:12,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In23917037 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In23917037 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out23917037| |P2Thread1of1ForFork0_#t~ite38_Out23917037|))) (or (and (or .cse0 .cse1) (= ~z~0_In23917037 |P2Thread1of1ForFork0_#t~ite38_Out23917037|) .cse2) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out23917037| ~z$w_buff1~0_In23917037) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In23917037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In23917037, ~z$w_buff1~0=~z$w_buff1~0_In23917037, ~z~0=~z~0_In23917037} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out23917037|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out23917037|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In23917037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In23917037, ~z$w_buff1~0=~z$w_buff1~0_In23917037, ~z~0=~z~0_In23917037} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:53:12,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1341385689 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1341385689 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1341385689|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1341385689 |P2Thread1of1ForFork0_#t~ite40_Out-1341385689|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1341385689, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1341385689} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1341385689, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1341385689|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1341385689} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 16:53:12,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-269124084 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-269124084 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-269124084 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-269124084 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-269124084 |P2Thread1of1ForFork0_#t~ite41_Out-269124084|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-269124084|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-269124084, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-269124084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-269124084, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-269124084} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-269124084, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-269124084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-269124084, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-269124084, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-269124084|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 16:53:12,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In858172812 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In858172812 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out858172812| ~z$r_buff0_thd3~0_In858172812) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out858172812| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In858172812, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In858172812} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In858172812, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In858172812, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out858172812|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:53:12,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-650145266 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-650145266 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-650145266 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-650145266 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-650145266|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-650145266 |P2Thread1of1ForFork0_#t~ite43_Out-650145266|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-650145266, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-650145266, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-650145266, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-650145266} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-650145266|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-650145266, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-650145266, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-650145266, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-650145266} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 16:53:12,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:53:12,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1593018110 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1593018110 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1593018110|)) (and (= ~z$w_buff0_used~0_In1593018110 |P0Thread1of1ForFork1_#t~ite5_Out1593018110|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1593018110, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1593018110} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1593018110|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1593018110, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1593018110} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 16:53:12,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-630647716 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-630647716 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-630647716 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-630647716 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-630647716| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-630647716| ~z$w_buff1_used~0_In-630647716)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-630647716, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-630647716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-630647716, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-630647716} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-630647716, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-630647716|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-630647716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-630647716, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-630647716} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 16:53:12,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2022006577 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-2022006577 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In-2022006577 ~z$r_buff0_thd1~0_Out-2022006577) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-2022006577)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2022006577, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2022006577} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2022006577, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-2022006577|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2022006577} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:53:12,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In490583400 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In490583400 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In490583400 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In490583400 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out490583400|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In490583400 |P0Thread1of1ForFork1_#t~ite8_Out490583400|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In490583400, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In490583400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In490583400, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In490583400} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out490583400|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In490583400, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In490583400, ~z$w_buff1_used~0=~z$w_buff1_used~0_In490583400, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In490583400} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 16:53:12,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:53:12,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1136653629 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1136653629 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1136653629| ~z$w_buff0_used~0_In-1136653629)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1136653629| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1136653629, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1136653629} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1136653629, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1136653629|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1136653629} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:53:12,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-376505691 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-376505691 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-376505691 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-376505691 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-376505691|)) (and (= ~z$w_buff1_used~0_In-376505691 |P1Thread1of1ForFork2_#t~ite12_Out-376505691|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-376505691, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-376505691, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-376505691, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-376505691} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-376505691, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-376505691, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-376505691, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-376505691|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-376505691} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 16:53:12,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-733221519 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-733221519 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-733221519 |P1Thread1of1ForFork2_#t~ite13_Out-733221519|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-733221519| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-733221519, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-733221519} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-733221519, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-733221519|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-733221519} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 16:53:12,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1089374552 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1089374552 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1089374552 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1089374552 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1089374552| ~z$r_buff1_thd2~0_In-1089374552) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1089374552| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1089374552, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1089374552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1089374552, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1089374552} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1089374552, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1089374552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1089374552, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1089374552|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1089374552} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:53:12,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 16:53:12,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:53:12,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1397763898 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1397763898 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1397763898 |ULTIMATE.start_main_#t~ite47_Out1397763898|)) (and (or .cse1 .cse0) (= ~z~0_In1397763898 |ULTIMATE.start_main_#t~ite47_Out1397763898|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1397763898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1397763898, ~z$w_buff1~0=~z$w_buff1~0_In1397763898, ~z~0=~z~0_In1397763898} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1397763898, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1397763898|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1397763898, ~z$w_buff1~0=~z$w_buff1~0_In1397763898, ~z~0=~z~0_In1397763898} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:53:12,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 16:53:12,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-537178692 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-537178692 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-537178692| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-537178692| ~z$w_buff0_used~0_In-537178692) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-537178692, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-537178692} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-537178692, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-537178692, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-537178692|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 16:53:12,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In804853791 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In804853791 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In804853791 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In804853791 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out804853791| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite50_Out804853791| ~z$w_buff1_used~0_In804853791) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In804853791, ~z$w_buff0_used~0=~z$w_buff0_used~0_In804853791, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In804853791, ~z$w_buff1_used~0=~z$w_buff1_used~0_In804853791} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out804853791|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In804853791, ~z$w_buff0_used~0=~z$w_buff0_used~0_In804853791, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In804853791, ~z$w_buff1_used~0=~z$w_buff1_used~0_In804853791} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 16:53:12,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In227333529 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In227333529 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out227333529| 0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In227333529 |ULTIMATE.start_main_#t~ite51_Out227333529|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In227333529, ~z$w_buff0_used~0=~z$w_buff0_used~0_In227333529} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In227333529, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out227333529|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In227333529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 16:53:12,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-755884683 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-755884683 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-755884683 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-755884683 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-755884683| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-755884683| ~z$r_buff1_thd0~0_In-755884683)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-755884683, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-755884683, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-755884683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755884683} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-755884683|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-755884683, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-755884683, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-755884683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-755884683} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 16:53:12,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:53:12,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:53:12 BasicIcfg [2019-12-18 16:53:12,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:53:12,746 INFO L168 Benchmark]: Toolchain (without parser) took 133908.87 ms. Allocated memory was 136.8 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 100.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 16:53:12,747 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 16:53:12,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.07 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.6 MB in the beginning and 153.4 MB in the end (delta: -53.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:53:12,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.67 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:53:12,748 INFO L168 Benchmark]: Boogie Preprocessor took 37.38 ms. Allocated memory is still 200.3 MB. Free memory was 150.6 MB in the beginning and 148.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 16:53:12,748 INFO L168 Benchmark]: RCFGBuilder took 793.46 ms. Allocated memory is still 200.3 MB. Free memory was 148.6 MB in the beginning and 98.2 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-18 16:53:12,749 INFO L168 Benchmark]: TraceAbstraction took 132189.75 ms. Allocated memory was 200.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 16:53:12,751 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.07 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.6 MB in the beginning and 153.4 MB in the end (delta: -53.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.67 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.38 ms. Allocated memory is still 200.3 MB. Free memory was 150.6 MB in the beginning and 148.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 793.46 ms. Allocated memory is still 200.3 MB. Free memory was 148.6 MB in the beginning and 98.2 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 132189.75 ms. Allocated memory was 200.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 97.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_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=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 131.8s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 45.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11516 SDtfs, 14205 SDslu, 35881 SDs, 0 SdLazy, 20447 SolverSat, 645 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 126 SyntacticMatches, 46 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 53.6s AutomataMinimizationTime, 41 MinimizatonAttempts, 503163 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1998 NumberOfCodeBlocks, 1998 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1891 ConstructedInterpolants, 0 QuantifiedInterpolants, 456199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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...