/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:47:06,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:47:06,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:47:06,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:47:06,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:47:06,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:47:06,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:47:06,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:47:06,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:47:06,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:47:06,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:47:06,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:47:06,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:47:06,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:47:06,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:47:06,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:47:06,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:47:06,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:47:06,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:47:06,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:47:06,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:47:06,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:47:06,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:47:06,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:47:06,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:47:06,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:47:06,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:47:06,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:47:06,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:47:06,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:47:06,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:47:06,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:47:06,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:47:06,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:47:06,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:47:06,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:47:06,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:47:06,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:47:06,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:47:06,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:47:06,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:47:06,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:47:06,675 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:47:06,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:47:06,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:47:06,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:47:06,680 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:47:06,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:47:06,681 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:47:06,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:47:06,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:47:06,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:47:06,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:47:06,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:47:06,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:47:06,684 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:47:06,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:47:06,685 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:47:06,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:47:06,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:47:06,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:47:06,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:47:06,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:47:06,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:47:06,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:47:06,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:47:06,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:47:06,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:47:06,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:47:06,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:47:06,689 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:47:06,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:47:06,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:47:06,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:47:06,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:47:06,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:47:06,988 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:47:06,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_rmo.oepc.i [2019-12-26 21:47:07,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b8861cd/3ef1dd26b89c4bf0814f709f7f347025/FLAGc60ef2d56 [2019-12-26 21:47:07,618 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:47:07,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_rmo.oepc.i [2019-12-26 21:47:07,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b8861cd/3ef1dd26b89c4bf0814f709f7f347025/FLAGc60ef2d56 [2019-12-26 21:47:07,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b8861cd/3ef1dd26b89c4bf0814f709f7f347025 [2019-12-26 21:47:07,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:47:07,919 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:47:07,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:47:07,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:47:07,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:47:07,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:47:07" (1/1) ... [2019-12-26 21:47:07,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab1e885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:07, skipping insertion in model container [2019-12-26 21:47:07,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:47:07" (1/1) ... [2019-12-26 21:47:07,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:47:08,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:47:08,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:47:08,526 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:47:08,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:47:08,679 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:47:08,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08 WrapperNode [2019-12-26 21:47:08,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:47:08,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:47:08,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:47:08,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:47:08,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08" (1/1) ... [2019-12-26 21:47:08,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08" (1/1) ... [2019-12-26 21:47:08,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:47:08,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:47:08,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:47:08,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:47:08,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08" (1/1) ... [2019-12-26 21:47:08,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08" (1/1) ... [2019-12-26 21:47:08,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08" (1/1) ... [2019-12-26 21:47:08,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08" (1/1) ... [2019-12-26 21:47:08,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08" (1/1) ... [2019-12-26 21:47:08,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08" (1/1) ... [2019-12-26 21:47:08,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08" (1/1) ... [2019-12-26 21:47:08,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:47:08,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:47:08,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:47:08,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:47:08,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08" (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-26 21:47:08,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:47:08,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:47:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:47:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:47:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:47:08,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:47:08,851 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:47:08,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:47:08,852 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:47:08,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:47:08,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:47:08,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:47:08,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:47:08,854 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:47:09,665 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:47:09,666 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:47:09,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:47:09 BoogieIcfgContainer [2019-12-26 21:47:09,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:47:09,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:47:09,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:47:09,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:47:09,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:47:07" (1/3) ... [2019-12-26 21:47:09,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb2943e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:47:09, skipping insertion in model container [2019-12-26 21:47:09,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:47:08" (2/3) ... [2019-12-26 21:47:09,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb2943e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:47:09, skipping insertion in model container [2019-12-26 21:47:09,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:47:09" (3/3) ... [2019-12-26 21:47:09,676 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_rmo.oepc.i [2019-12-26 21:47:09,686 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:47:09,687 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:47:09,694 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:47:09,696 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:47:09,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,742 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,742 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,743 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,743 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,777 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,777 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,808 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,810 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:47:09,846 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:47:09,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:47:09,869 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:47:09,869 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:47:09,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:47:09,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:47:09,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:47:09,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:47:09,870 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:47:09,894 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-26 21:47:09,896 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 21:47:10,028 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 21:47:10,029 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:47:10,050 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. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:47:10,076 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 21:47:10,153 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 21:47:10,153 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:47:10,161 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. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:47:10,182 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:47:10,183 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:47:15,252 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 21:47:15,377 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 21:47:15,640 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-26 21:47:15,640 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-26 21:47:15,644 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-26 21:47:36,693 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-26 21:47:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-26 21:47:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:47:36,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:36,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:47:36,705 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-26 21:47:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:36,712 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-26 21:47:36,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:36,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328752392] [2019-12-26 21:47:36,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:36,917 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-26 21:47:36,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328752392] [2019-12-26 21:47:36,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:36,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:47:36,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201961751] [2019-12-26 21:47:36,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:47:36,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:36,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:47:36,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:47:36,945 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-26 21:47:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:41,158 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-26 21:47:41,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:47:41,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:47:41,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:41,872 INFO L225 Difference]: With dead ends: 121140 [2019-12-26 21:47:41,872 INFO L226 Difference]: Without dead ends: 107958 [2019-12-26 21:47:41,874 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-26 21:47:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-26 21:47:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-26 21:47:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-26 21:47:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-26 21:47:49,434 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-26 21:47:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:47:49,434 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-26 21:47:49,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:47:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-26 21:47:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:47:49,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:47:49,439 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:47:49,440 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-26 21:47:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:47:49,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-26 21:47:49,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:47:49,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762595246] [2019-12-26 21:47:49,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:47:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:47:49,601 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-26 21:47:49,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762595246] [2019-12-26 21:47:49,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:47:49,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:47:49,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779981068] [2019-12-26 21:47:49,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:47:49,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:47:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:47:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:47:49,605 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-26 21:47:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:47:55,162 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-26 21:47:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:47:55,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:47:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:47:55,968 INFO L225 Difference]: With dead ends: 172022 [2019-12-26 21:47:55,969 INFO L226 Difference]: Without dead ends: 171924 [2019-12-26 21:47:55,970 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-26 21:48:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-26 21:48:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-26 21:48:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-26 21:48:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-26 21:48:08,642 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-26 21:48:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:08,643 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-26 21:48:08,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:48:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-26 21:48:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:48:08,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:08,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:48:08,650 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-26 21:48:08,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:08,650 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-26 21:48:08,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:08,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392150205] [2019-12-26 21:48:08,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:08,698 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-26 21:48:08,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392150205] [2019-12-26 21:48:08,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:08,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:48:08,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664061820] [2019-12-26 21:48:08,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:48:08,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:08,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:48:08,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:48:08,701 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-26 21:48:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:08,849 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-26 21:48:08,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:48:08,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:48:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:08,931 INFO L225 Difference]: With dead ends: 33388 [2019-12-26 21:48:08,931 INFO L226 Difference]: Without dead ends: 33388 [2019-12-26 21:48:08,932 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-26 21:48:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-26 21:48:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-26 21:48:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-26 21:48:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-26 21:48:14,304 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-26 21:48:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:14,304 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-26 21:48:14,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:48:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-26 21:48:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:48:14,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:14,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:48:14,307 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-26 21:48:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-26 21:48:14,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:14,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786657127] [2019-12-26 21:48:14,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:14,371 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-26 21:48:14,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786657127] [2019-12-26 21:48:14,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:14,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:48:14,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859097871] [2019-12-26 21:48:14,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:48:14,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:48:14,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:48:14,374 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-26 21:48:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:14,631 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-26 21:48:14,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:48:14,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 21:48:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:14,722 INFO L225 Difference]: With dead ends: 52822 [2019-12-26 21:48:14,722 INFO L226 Difference]: Without dead ends: 52822 [2019-12-26 21:48:14,722 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-26 21:48:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-26 21:48:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-26 21:48:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-26 21:48:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-26 21:48:15,508 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-26 21:48:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:15,510 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-26 21:48:15,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:48:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-26 21:48:15,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:48:15,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:15,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:48:15,513 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-26 21:48:15,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:15,514 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-26 21:48:15,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:15,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390895168] [2019-12-26 21:48:15,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:15,582 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-26 21:48:15,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390895168] [2019-12-26 21:48:15,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:15,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:48:15,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969108487] [2019-12-26 21:48:15,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:48:15,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:48:15,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:48:15,584 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-26 21:48:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:15,968 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-26 21:48:15,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:48:15,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:48:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:16,046 INFO L225 Difference]: With dead ends: 46903 [2019-12-26 21:48:16,046 INFO L226 Difference]: Without dead ends: 46903 [2019-12-26 21:48:16,046 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-26 21:48:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-26 21:48:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-26 21:48:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-26 21:48:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-26 21:48:17,278 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-26 21:48:17,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:17,278 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-26 21:48:17,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:48:17,278 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-26 21:48:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:48:17,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:17,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:48:17,283 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-26 21:48:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-26 21:48:17,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:17,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746731227] [2019-12-26 21:48:17,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:17,347 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-26 21:48:17,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746731227] [2019-12-26 21:48:17,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:17,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:48:17,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324618586] [2019-12-26 21:48:17,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:48:17,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:48:17,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:48:17,349 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-26 21:48:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:17,717 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-26 21:48:17,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:48:17,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:48:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:17,808 INFO L225 Difference]: With dead ends: 51478 [2019-12-26 21:48:17,808 INFO L226 Difference]: Without dead ends: 51478 [2019-12-26 21:48:17,808 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-26 21:48:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-26 21:48:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-26 21:48:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-26 21:48:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-26 21:48:18,636 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-26 21:48:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:18,637 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-26 21:48:18,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:48:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-26 21:48:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:48:18,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:18,650 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-26 21:48:18,650 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-26 21:48:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:18,651 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-26 21:48:18,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:18,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629178383] [2019-12-26 21:48:18,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:18,726 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-26 21:48:18,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629178383] [2019-12-26 21:48:18,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:18,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:48:18,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73711912] [2019-12-26 21:48:18,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:48:18,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:18,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:48:18,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:48:18,728 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-26 21:48:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:19,777 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-26 21:48:19,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:48:19,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:48:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:19,888 INFO L225 Difference]: With dead ends: 61264 [2019-12-26 21:48:19,888 INFO L226 Difference]: Without dead ends: 61250 [2019-12-26 21:48:19,889 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-26 21:48:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-26 21:48:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-26 21:48:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-26 21:48:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-26 21:48:20,769 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-26 21:48:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:20,770 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-26 21:48:20,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:48:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-26 21:48:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:48:20,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:20,781 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-26 21:48:20,781 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-26 21:48:20,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:20,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-26 21:48:20,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:20,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272457352] [2019-12-26 21:48:20,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:20,849 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-26 21:48:20,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272457352] [2019-12-26 21:48:20,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:20,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:48:20,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299925091] [2019-12-26 21:48:20,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:48:20,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:20,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:48:20,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:48:20,851 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-26 21:48:21,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:21,507 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-26 21:48:21,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:48:21,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:48:21,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:21,614 INFO L225 Difference]: With dead ends: 63752 [2019-12-26 21:48:21,614 INFO L226 Difference]: Without dead ends: 63738 [2019-12-26 21:48:21,614 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-26 21:48:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-26 21:48:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-26 21:48:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-26 21:48:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-26 21:48:23,175 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-26 21:48:23,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:23,176 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-26 21:48:23,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:48:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-26 21:48:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:48:23,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:23,191 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-26 21:48:23,192 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-26 21:48:23,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:23,192 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-26 21:48:23,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:23,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083408872] [2019-12-26 21:48:23,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:23,235 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-26 21:48:23,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083408872] [2019-12-26 21:48:23,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:23,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:48:23,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130592409] [2019-12-26 21:48:23,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:48:23,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:23,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:48:23,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:48:23,237 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-26 21:48:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:23,331 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-26 21:48:23,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:48:23,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:48:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:23,363 INFO L225 Difference]: With dead ends: 17193 [2019-12-26 21:48:23,364 INFO L226 Difference]: Without dead ends: 17193 [2019-12-26 21:48:23,364 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-26 21:48:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-26 21:48:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-26 21:48:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-26 21:48:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-26 21:48:23,638 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-26 21:48:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:23,638 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-26 21:48:23,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:48:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-26 21:48:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 21:48:23,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:23,651 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-26 21:48:23,651 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-26 21:48:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:23,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-26 21:48:23,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:23,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35485258] [2019-12-26 21:48:23,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:23,715 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-26 21:48:23,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35485258] [2019-12-26 21:48:23,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:23,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:48:23,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384275288] [2019-12-26 21:48:23,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:48:23,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:23,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:48:23,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:48:23,717 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-26 21:48:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:24,069 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-26 21:48:24,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:48:24,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 21:48:24,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:24,100 INFO L225 Difference]: With dead ends: 21613 [2019-12-26 21:48:24,100 INFO L226 Difference]: Without dead ends: 21613 [2019-12-26 21:48:24,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:48:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-26 21:48:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-26 21:48:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-26 21:48:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-26 21:48:24,407 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-26 21:48:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:24,407 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-26 21:48:24,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:48:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-26 21:48:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:48:24,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:24,422 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-26 21:48:24,422 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-26 21:48:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-26 21:48:24,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:24,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826834367] [2019-12-26 21:48:24,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:24,506 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-26 21:48:24,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826834367] [2019-12-26 21:48:24,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:24,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:48:24,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110661068] [2019-12-26 21:48:24,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:48:24,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:24,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:48:24,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:48:24,509 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-26 21:48:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:24,950 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-26 21:48:24,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:48:24,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:48:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:25,000 INFO L225 Difference]: With dead ends: 23624 [2019-12-26 21:48:25,000 INFO L226 Difference]: Without dead ends: 23624 [2019-12-26 21:48:25,001 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-26 21:48:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-26 21:48:25,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-26 21:48:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-26 21:48:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-26 21:48:25,463 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-26 21:48:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:25,463 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-26 21:48:25,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:48:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-26 21:48:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 21:48:25,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:25,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:48:25,483 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-26 21:48:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-26 21:48:25,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:25,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097104836] [2019-12-26 21:48:25,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:48:25,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097104836] [2019-12-26 21:48:25,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:25,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:48:25,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275743704] [2019-12-26 21:48:25,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:48:25,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:25,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:48:25,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:48:25,559 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-26 21:48:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:26,251 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-26 21:48:26,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:48:26,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-26 21:48:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:26,307 INFO L225 Difference]: With dead ends: 27031 [2019-12-26 21:48:26,308 INFO L226 Difference]: Without dead ends: 27031 [2019-12-26 21:48:26,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:48:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-26 21:48:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-26 21:48:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-26 21:48:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-26 21:48:27,040 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-26 21:48:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:27,040 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-26 21:48:27,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:48:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-26 21:48:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:48:27,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:27,063 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-26 21:48:27,063 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-26 21:48:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:27,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-26 21:48:27,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:27,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316338754] [2019-12-26 21:48:27,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:27,155 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-26 21:48:27,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316338754] [2019-12-26 21:48:27,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:27,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:48:27,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347449158] [2019-12-26 21:48:27,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:48:27,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:27,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:48:27,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:48:27,158 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-26 21:48:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:27,849 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-26 21:48:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:48:27,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-26 21:48:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:27,887 INFO L225 Difference]: With dead ends: 26334 [2019-12-26 21:48:27,887 INFO L226 Difference]: Without dead ends: 26334 [2019-12-26 21:48:27,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:48:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-26 21:48:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-26 21:48:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-26 21:48:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-26 21:48:28,206 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-26 21:48:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:28,207 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-26 21:48:28,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:48:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-26 21:48:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:48:28,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:28,223 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-26 21:48:28,223 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-26 21:48:28,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:28,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-26 21:48:28,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:28,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345866477] [2019-12-26 21:48:28,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:28,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-26 21:48:28,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345866477] [2019-12-26 21:48:28,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:28,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:48:28,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70998424] [2019-12-26 21:48:28,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:48:28,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:28,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:48:28,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:48:28,285 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-26 21:48:28,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:28,352 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-26 21:48:28,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:48:28,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:48:28,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:28,385 INFO L225 Difference]: With dead ends: 17641 [2019-12-26 21:48:28,385 INFO L226 Difference]: Without dead ends: 17641 [2019-12-26 21:48:28,386 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-26 21:48:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-26 21:48:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-26 21:48:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-26 21:48:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-26 21:48:28,663 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-26 21:48:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:28,663 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-26 21:48:28,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:48:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-26 21:48:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:48:28,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:28,681 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-26 21:48:28,681 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-26 21:48:28,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-26 21:48:28,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:28,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212366262] [2019-12-26 21:48:28,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:28,750 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-26 21:48:28,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212366262] [2019-12-26 21:48:28,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:28,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:48:28,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148327609] [2019-12-26 21:48:28,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:48:28,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:28,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:48:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:48:28,752 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-26 21:48:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:29,366 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-26 21:48:29,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:48:29,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:48:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:29,416 INFO L225 Difference]: With dead ends: 25346 [2019-12-26 21:48:29,417 INFO L226 Difference]: Without dead ends: 25346 [2019-12-26 21:48:29,417 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-26 21:48:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-26 21:48:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-26 21:48:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-26 21:48:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-26 21:48:29,764 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-26 21:48:29,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:29,764 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-26 21:48:29,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:48:29,764 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-26 21:48:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:48:29,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:29,792 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-26 21:48:29,792 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-26 21:48:29,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:29,792 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-26 21:48:29,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:29,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218863886] [2019-12-26 21:48:29,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:29,855 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-26 21:48:29,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218863886] [2019-12-26 21:48:29,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:29,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:48:29,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943128219] [2019-12-26 21:48:29,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:48:29,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:29,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:48:29,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:48:29,857 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-26 21:48:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:29,963 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-26 21:48:29,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:48:29,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:48:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:30,002 INFO L225 Difference]: With dead ends: 22175 [2019-12-26 21:48:30,003 INFO L226 Difference]: Without dead ends: 22175 [2019-12-26 21:48:30,003 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-26 21:48:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-26 21:48:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-26 21:48:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-26 21:48:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-26 21:48:31,003 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-26 21:48:31,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:31,003 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-26 21:48:31,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:48:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-26 21:48:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:48:31,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:31,035 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-26 21:48:31,035 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-26 21:48:31,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-26 21:48:31,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:31,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471835708] [2019-12-26 21:48:31,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:48:31,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471835708] [2019-12-26 21:48:31,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:31,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:48:31,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538199783] [2019-12-26 21:48:31,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:48:31,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:31,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:48:31,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:48:31,141 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-26 21:48:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:31,772 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-26 21:48:31,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 21:48:31,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 21:48:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:31,866 INFO L225 Difference]: With dead ends: 62478 [2019-12-26 21:48:31,867 INFO L226 Difference]: Without dead ends: 47634 [2019-12-26 21:48:31,869 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-26 21:48:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-26 21:48:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-26 21:48:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-26 21:48:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-26 21:48:32,461 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-26 21:48:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:32,462 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-26 21:48:32,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:48:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-26 21:48:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:48:32,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:32,491 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-26 21:48:32,492 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-26 21:48:32,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-26 21:48:32,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:32,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613192205] [2019-12-26 21:48:32,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:32,581 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-26 21:48:32,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613192205] [2019-12-26 21:48:32,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:32,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:48:32,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403744889] [2019-12-26 21:48:32,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:48:32,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:48:32,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:48:32,589 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-26 21:48:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:33,121 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-26 21:48:33,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:48:33,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 21:48:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:33,191 INFO L225 Difference]: With dead ends: 68433 [2019-12-26 21:48:33,191 INFO L226 Difference]: Without dead ends: 48478 [2019-12-26 21:48:33,191 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-26 21:48:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-26 21:48:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-26 21:48:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-26 21:48:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-26 21:48:33,816 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-26 21:48:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:33,817 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-26 21:48:33,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:48:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-26 21:48:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:48:33,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:33,850 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-26 21:48:33,850 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-26 21:48:33,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-26 21:48:33,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:33,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341562477] [2019-12-26 21:48:33,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:33,946 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-26 21:48:33,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341562477] [2019-12-26 21:48:33,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:33,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:48:33,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583895347] [2019-12-26 21:48:33,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:48:33,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:33,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:48:33,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:48:33,948 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-26 21:48:34,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:34,726 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-26 21:48:34,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:48:34,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 21:48:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:34,799 INFO L225 Difference]: With dead ends: 59843 [2019-12-26 21:48:34,800 INFO L226 Difference]: Without dead ends: 52762 [2019-12-26 21:48:34,800 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-26 21:48:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-26 21:48:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-26 21:48:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-26 21:48:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-26 21:48:35,399 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-26 21:48:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:35,399 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-26 21:48:35,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:48:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-26 21:48:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 21:48:35,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:35,430 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-26 21:48:35,430 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-26 21:48:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-26 21:48:35,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:35,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497069167] [2019-12-26 21:48:35,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:35,492 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-26 21:48:35,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497069167] [2019-12-26 21:48:35,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:35,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:48:35,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105754513] [2019-12-26 21:48:35,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:48:35,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:35,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:48:35,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:48:35,494 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 3 states. [2019-12-26 21:48:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:35,692 INFO L93 Difference]: Finished difference Result 35624 states and 109784 transitions. [2019-12-26 21:48:35,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:48:35,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-26 21:48:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:35,770 INFO L225 Difference]: With dead ends: 35624 [2019-12-26 21:48:35,771 INFO L226 Difference]: Without dead ends: 35624 [2019-12-26 21:48:35,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:48:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35624 states. [2019-12-26 21:48:36,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35624 to 31022. [2019-12-26 21:48:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2019-12-26 21:48:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 96384 transitions. [2019-12-26 21:48:36,345 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 96384 transitions. Word has length 63 [2019-12-26 21:48:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:36,345 INFO L462 AbstractCegarLoop]: Abstraction has 31022 states and 96384 transitions. [2019-12-26 21:48:36,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:48:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 96384 transitions. [2019-12-26 21:48:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:48:36,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:36,381 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-26 21:48:36,381 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-26 21:48:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:36,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-26 21:48:36,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:36,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806608487] [2019-12-26 21:48:36,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:36,444 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-26 21:48:36,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806608487] [2019-12-26 21:48:36,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:36,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:48:36,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483658461] [2019-12-26 21:48:36,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:48:36,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:36,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:48:36,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:48:36,446 INFO L87 Difference]: Start difference. First operand 31022 states and 96384 transitions. Second operand 3 states. [2019-12-26 21:48:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:36,611 INFO L93 Difference]: Finished difference Result 31021 states and 96382 transitions. [2019-12-26 21:48:36,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:48:36,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:48:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:36,689 INFO L225 Difference]: With dead ends: 31021 [2019-12-26 21:48:36,689 INFO L226 Difference]: Without dead ends: 31021 [2019-12-26 21:48:36,690 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-26 21:48:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31021 states. [2019-12-26 21:48:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31021 to 27348. [2019-12-26 21:48:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-26 21:48:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 86085 transitions. [2019-12-26 21:48:37,820 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 86085 transitions. Word has length 64 [2019-12-26 21:48:37,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:37,821 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 86085 transitions. [2019-12-26 21:48:37,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:48:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 86085 transitions. [2019-12-26 21:48:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:48:37,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:37,853 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-26 21:48:37,853 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-26 21:48:37,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:37,853 INFO L82 PathProgramCache]: Analyzing trace with hash 78921339, now seen corresponding path program 1 times [2019-12-26 21:48:37,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:37,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497525098] [2019-12-26 21:48:37,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:37,954 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-26 21:48:37,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497525098] [2019-12-26 21:48:37,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:37,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:48:37,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049842100] [2019-12-26 21:48:37,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:48:37,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:37,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:48:37,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:48:37,956 INFO L87 Difference]: Start difference. First operand 27348 states and 86085 transitions. Second operand 3 states. [2019-12-26 21:48:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:38,082 INFO L93 Difference]: Finished difference Result 23805 states and 73809 transitions. [2019-12-26 21:48:38,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:48:38,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:48:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:38,140 INFO L225 Difference]: With dead ends: 23805 [2019-12-26 21:48:38,141 INFO L226 Difference]: Without dead ends: 23805 [2019-12-26 21:48:38,141 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-26 21:48:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23805 states. [2019-12-26 21:48:38,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23805 to 21779. [2019-12-26 21:48:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21779 states. [2019-12-26 21:48:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21779 states to 21779 states and 67477 transitions. [2019-12-26 21:48:38,781 INFO L78 Accepts]: Start accepts. Automaton has 21779 states and 67477 transitions. Word has length 65 [2019-12-26 21:48:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:38,782 INFO L462 AbstractCegarLoop]: Abstraction has 21779 states and 67477 transitions. [2019-12-26 21:48:38,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:48:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 21779 states and 67477 transitions. [2019-12-26 21:48:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:38,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:38,815 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-26 21:48:38,815 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-26 21:48:38,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:38,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-26 21:48:38,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:38,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403456575] [2019-12-26 21:48:38,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:38,994 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-26 21:48:38,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403456575] [2019-12-26 21:48:38,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:38,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:48:38,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136092322] [2019-12-26 21:48:38,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:48:38,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:38,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:48:38,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:48:38,996 INFO L87 Difference]: Start difference. First operand 21779 states and 67477 transitions. Second operand 11 states. [2019-12-26 21:48:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:40,164 INFO L93 Difference]: Finished difference Result 47319 states and 146708 transitions. [2019-12-26 21:48:40,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:48:40,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:48:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:40,230 INFO L225 Difference]: With dead ends: 47319 [2019-12-26 21:48:40,231 INFO L226 Difference]: Without dead ends: 44783 [2019-12-26 21:48:40,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:48:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44783 states. [2019-12-26 21:48:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44783 to 26488. [2019-12-26 21:48:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26488 states. [2019-12-26 21:48:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26488 states to 26488 states and 81976 transitions. [2019-12-26 21:48:40,783 INFO L78 Accepts]: Start accepts. Automaton has 26488 states and 81976 transitions. Word has length 66 [2019-12-26 21:48:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:40,783 INFO L462 AbstractCegarLoop]: Abstraction has 26488 states and 81976 transitions. [2019-12-26 21:48:40,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:48:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 26488 states and 81976 transitions. [2019-12-26 21:48:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:40,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:40,815 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-26 21:48:40,815 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-26 21:48:40,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:40,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 2 times [2019-12-26 21:48:40,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:40,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61915595] [2019-12-26 21:48:40,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:41,370 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-26 21:48:41,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61915595] [2019-12-26 21:48:41,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:41,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 21:48:41,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425709794] [2019-12-26 21:48:41,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 21:48:41,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:41,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 21:48:41,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:48:41,372 INFO L87 Difference]: Start difference. First operand 26488 states and 81976 transitions. Second operand 16 states. [2019-12-26 21:48:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:45,391 INFO L93 Difference]: Finished difference Result 42019 states and 128193 transitions. [2019-12-26 21:48:45,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-26 21:48:45,392 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-26 21:48:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:45,444 INFO L225 Difference]: With dead ends: 42019 [2019-12-26 21:48:45,444 INFO L226 Difference]: Without dead ends: 38330 [2019-12-26 21:48:45,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=1348, Unknown=0, NotChecked=0, Total=1722 [2019-12-26 21:48:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38330 states. [2019-12-26 21:48:45,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38330 to 27407. [2019-12-26 21:48:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27407 states. [2019-12-26 21:48:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27407 states to 27407 states and 84533 transitions. [2019-12-26 21:48:45,906 INFO L78 Accepts]: Start accepts. Automaton has 27407 states and 84533 transitions. Word has length 66 [2019-12-26 21:48:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:45,906 INFO L462 AbstractCegarLoop]: Abstraction has 27407 states and 84533 transitions. [2019-12-26 21:48:45,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 21:48:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 27407 states and 84533 transitions. [2019-12-26 21:48:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:45,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:45,933 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-26 21:48:45,933 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-26 21:48:45,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:45,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1334990131, now seen corresponding path program 3 times [2019-12-26 21:48:45,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:45,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402684755] [2019-12-26 21:48:45,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:46,442 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-26 21:48:46,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402684755] [2019-12-26 21:48:46,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:46,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 21:48:46,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117401200] [2019-12-26 21:48:46,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 21:48:46,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:46,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 21:48:46,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:48:46,444 INFO L87 Difference]: Start difference. First operand 27407 states and 84533 transitions. Second operand 17 states. [2019-12-26 21:48:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:50,848 INFO L93 Difference]: Finished difference Result 42837 states and 130342 transitions. [2019-12-26 21:48:50,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-26 21:48:50,849 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-26 21:48:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:50,900 INFO L225 Difference]: With dead ends: 42837 [2019-12-26 21:48:50,900 INFO L226 Difference]: Without dead ends: 37184 [2019-12-26 21:48:50,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=521, Invalid=2235, Unknown=0, NotChecked=0, Total=2756 [2019-12-26 21:48:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37184 states. [2019-12-26 21:48:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37184 to 27441. [2019-12-26 21:48:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27441 states. [2019-12-26 21:48:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27441 states to 27441 states and 84460 transitions. [2019-12-26 21:48:51,702 INFO L78 Accepts]: Start accepts. Automaton has 27441 states and 84460 transitions. Word has length 66 [2019-12-26 21:48:51,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:51,702 INFO L462 AbstractCegarLoop]: Abstraction has 27441 states and 84460 transitions. [2019-12-26 21:48:51,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 21:48:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 27441 states and 84460 transitions. [2019-12-26 21:48:51,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:51,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:51,733 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-26 21:48:51,733 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-26 21:48:51,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:51,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1345972671, now seen corresponding path program 4 times [2019-12-26 21:48:51,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:51,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086895838] [2019-12-26 21:48:51,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:51,938 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-26 21:48:51,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086895838] [2019-12-26 21:48:51,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:51,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:48:51,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975694086] [2019-12-26 21:48:51,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:48:51,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:48:51,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:48:51,939 INFO L87 Difference]: Start difference. First operand 27441 states and 84460 transitions. Second operand 12 states. [2019-12-26 21:48:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:54,136 INFO L93 Difference]: Finished difference Result 40203 states and 121816 transitions. [2019-12-26 21:48:54,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 21:48:54,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 21:48:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:54,182 INFO L225 Difference]: With dead ends: 40203 [2019-12-26 21:48:54,183 INFO L226 Difference]: Without dead ends: 33000 [2019-12-26 21:48:54,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:48:54,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33000 states. [2019-12-26 21:48:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33000 to 25452. [2019-12-26 21:48:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25452 states. [2019-12-26 21:48:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25452 states to 25452 states and 78065 transitions. [2019-12-26 21:48:54,651 INFO L78 Accepts]: Start accepts. Automaton has 25452 states and 78065 transitions. Word has length 66 [2019-12-26 21:48:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:54,651 INFO L462 AbstractCegarLoop]: Abstraction has 25452 states and 78065 transitions. [2019-12-26 21:48:54,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:48:54,651 INFO L276 IsEmpty]: Start isEmpty. Operand 25452 states and 78065 transitions. [2019-12-26 21:48:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:54,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:54,680 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-26 21:48:54,680 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-26 21:48:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:54,681 INFO L82 PathProgramCache]: Analyzing trace with hash 824750475, now seen corresponding path program 5 times [2019-12-26 21:48:54,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:54,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546989710] [2019-12-26 21:48:54,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:54,869 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-26 21:48:54,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546989710] [2019-12-26 21:48:54,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:54,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:48:54,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738032612] [2019-12-26 21:48:54,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:48:54,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:48:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:48:54,872 INFO L87 Difference]: Start difference. First operand 25452 states and 78065 transitions. Second operand 11 states. [2019-12-26 21:48:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:55,831 INFO L93 Difference]: Finished difference Result 43183 states and 131767 transitions. [2019-12-26 21:48:55,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:48:55,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:48:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:55,883 INFO L225 Difference]: With dead ends: 43183 [2019-12-26 21:48:55,884 INFO L226 Difference]: Without dead ends: 36564 [2019-12-26 21:48:55,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:48:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36564 states. [2019-12-26 21:48:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36564 to 21457. [2019-12-26 21:48:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21457 states. [2019-12-26 21:48:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21457 states to 21457 states and 65926 transitions. [2019-12-26 21:48:56,316 INFO L78 Accepts]: Start accepts. Automaton has 21457 states and 65926 transitions. Word has length 66 [2019-12-26 21:48:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:56,316 INFO L462 AbstractCegarLoop]: Abstraction has 21457 states and 65926 transitions. [2019-12-26 21:48:56,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:48:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 21457 states and 65926 transitions. [2019-12-26 21:48:56,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:56,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:56,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:48:56,340 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-26 21:48:56,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:56,340 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 6 times [2019-12-26 21:48:56,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:56,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796669102] [2019-12-26 21:48:56,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:48:56,548 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-26 21:48:56,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796669102] [2019-12-26 21:48:56,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:48:56,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:48:56,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538748298] [2019-12-26 21:48:56,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:48:56,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:48:56,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:48:56,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:48:56,549 INFO L87 Difference]: Start difference. First operand 21457 states and 65926 transitions. Second operand 12 states. [2019-12-26 21:48:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:48:57,957 INFO L93 Difference]: Finished difference Result 37077 states and 113516 transitions. [2019-12-26 21:48:57,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:48:57,957 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 21:48:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:48:58,009 INFO L225 Difference]: With dead ends: 37077 [2019-12-26 21:48:58,009 INFO L226 Difference]: Without dead ends: 36234 [2019-12-26 21:48:58,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:48:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36234 states. [2019-12-26 21:48:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36234 to 20887. [2019-12-26 21:48:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20887 states. [2019-12-26 21:48:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20887 states to 20887 states and 64357 transitions. [2019-12-26 21:48:58,467 INFO L78 Accepts]: Start accepts. Automaton has 20887 states and 64357 transitions. Word has length 66 [2019-12-26 21:48:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:48:58,467 INFO L462 AbstractCegarLoop]: Abstraction has 20887 states and 64357 transitions. [2019-12-26 21:48:58,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:48:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 20887 states and 64357 transitions. [2019-12-26 21:48:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:48:58,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:48:58,493 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-26 21:48:58,493 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-26 21:48:58,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:48:58,493 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 7 times [2019-12-26 21:48:58,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:48:58,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13374116] [2019-12-26 21:48:58,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:48:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:48:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:48:58,642 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:48:58,642 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:48:58,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t509~0.base_22|) 0) (= 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_ULTIMATE.start_main_~#t509~0.offset_16| 0) (= |v_#NULL.offset_6| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t509~0.base_22| 1) |v_#valid_69|) (= 0 v_~z$r_buff0_thd3~0_377) (= v_~__unbuffered_cnt~0_128 0) (= v_~z$r_buff0_thd1~0_378 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd0~0_195 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t509~0.base_22| 4)) (= v_~y~0_28 0) (= v_~z$w_buff1_used~0_500 0) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t509~0.base_22|) (= v_~z$r_buff0_thd2~0_182 0) (= 0 v_~z$r_buff1_thd3~0_396) (= 0 v_~x~0_245) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_35) (= v_~z$r_buff1_thd0~0_294 0) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t509~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t509~0.base_22|) |v_ULTIMATE.start_main_~#t509~0.offset_16| 0)) |v_#memory_int_19|) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~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_~#t509~0.base=|v_ULTIMATE.start_main_~#t509~0.base_22|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_72|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_195, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ULTIMATE.start_main_~#t511~0.offset=|v_ULTIMATE.start_main_~#t511~0.offset_14|, ULTIMATE.start_main_~#t509~0.offset=|v_ULTIMATE.start_main_~#t509~0.offset_16|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_~#t510~0.offset=|v_ULTIMATE.start_main_~#t510~0.offset_14|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t510~0.base=|v_ULTIMATE.start_main_~#t510~0.base_19|, ~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, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t511~0.base=|v_ULTIMATE.start_main_~#t511~0.base_17|, ~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_377, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_245, ~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_38, 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|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_294, ~y~0=v_~y~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_182, 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_378} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t509~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t511~0.offset, ULTIMATE.start_main_~#t509~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t510~0.offset, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t510~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t511~0.base, ~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, ~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-26 21:48:58,648 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_~x~0_11 1) (= 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)) 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, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~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_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~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, ~x~0] because there is no mapped edge [2019-12-26 21:48:58,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t510~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t510~0.base_11|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t510~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t510~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t510~0.base_11|) |v_ULTIMATE.start_main_~#t510~0.offset_10| 1)) |v_#memory_int_13|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t510~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t510~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t510~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t510~0.offset=|v_ULTIMATE.start_main_~#t510~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t510~0.base=|v_ULTIMATE.start_main_~#t510~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t510~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t510~0.base, #length] because there is no mapped edge [2019-12-26 21:48:58,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t511~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t511~0.base_12| 4)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t511~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t511~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t511~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t511~0.base_12|) |v_ULTIMATE.start_main_~#t511~0.offset_10| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t511~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t511~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t511~0.base=|v_ULTIMATE.start_main_~#t511~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t511~0.offset=|v_ULTIMATE.start_main_~#t511~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|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t511~0.base, ULTIMATE.start_main_~#t511~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-26 21:48:58,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out-2142433133| |P1Thread1of1ForFork2_#t~ite9_Out-2142433133|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2142433133 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-2142433133 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-2142433133| ~z~0_In-2142433133) (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-2142433133| ~z$w_buff1~0_In-2142433133) .cse0 (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2142433133, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2142433133, ~z$w_buff1~0=~z$w_buff1~0_In-2142433133, ~z~0=~z~0_In-2142433133} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2142433133|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2142433133, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-2142433133|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2142433133, ~z$w_buff1~0=~z$w_buff1~0_In-2142433133, ~z~0=~z~0_In-2142433133} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:48:58,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1138368773 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1138368773 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1138368773 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1138368773 256))) (= (mod ~z$w_buff0_used~0_In-1138368773 256) 0))) (= |P2Thread1of1ForFork0_#t~ite24_Out-1138368773| |P2Thread1of1ForFork0_#t~ite23_Out-1138368773|) (= ~z$w_buff1~0_In-1138368773 |P2Thread1of1ForFork0_#t~ite23_Out-1138368773|)) (and (= |P2Thread1of1ForFork0_#t~ite23_In-1138368773| |P2Thread1of1ForFork0_#t~ite23_Out-1138368773|) (= ~z$w_buff1~0_In-1138368773 |P2Thread1of1ForFork0_#t~ite24_Out-1138368773|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138368773, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1138368773, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1138368773|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138368773, ~z$w_buff1~0=~z$w_buff1~0_In-1138368773, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1138368773, ~weak$$choice2~0=~weak$$choice2~0_In-1138368773} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138368773, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1138368773|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1138368773, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1138368773|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138368773, ~z$w_buff1~0=~z$w_buff1~0_In-1138368773, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1138368773, ~weak$$choice2~0=~weak$$choice2~0_In-1138368773} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 21:48:58,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In20998280 256))) (.cse4 (= (mod ~weak$$choice2~0_In20998280 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In20998280 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In20998280 256))) (.cse5 (= |P2Thread1of1ForFork0_#t~ite29_Out20998280| |P2Thread1of1ForFork0_#t~ite30_Out20998280|)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In20998280 256)))) (or (and (or (and (= ~z$w_buff1_used~0_In20998280 |P2Thread1of1ForFork0_#t~ite29_Out20998280|) (or .cse0 (and .cse1 .cse2) (and .cse1 .cse3)) .cse4 .cse5) (and (not .cse4) (= ~z$w_buff1_used~0_In20998280 |P2Thread1of1ForFork0_#t~ite30_Out20998280|) (= |P2Thread1of1ForFork0_#t~ite29_Out20998280| |P2Thread1of1ForFork0_#t~ite29_In20998280|))) (= |P2Thread1of1ForFork0_#t~ite28_In20998280| |P2Thread1of1ForFork0_#t~ite28_Out20998280|)) (let ((.cse6 (not .cse1))) (and (not .cse0) .cse4 (= |P2Thread1of1ForFork0_#t~ite28_Out20998280| 0) (= |P2Thread1of1ForFork0_#t~ite29_Out20998280| |P2Thread1of1ForFork0_#t~ite28_Out20998280|) (or (not .cse3) .cse6) (or (not .cse2) .cse6) .cse5)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In20998280|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In20998280, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In20998280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In20998280, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In20998280, ~weak$$choice2~0=~weak$$choice2~0_In20998280, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In20998280|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out20998280|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In20998280, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In20998280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In20998280, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In20998280, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out20998280|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out20998280|, ~weak$$choice2~0=~weak$$choice2~0_In20998280} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 21:48:58,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_371 v_~z$r_buff0_thd3~0_370) (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, 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_370, 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-26 21:48:58,658 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-26 21:48:58,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In108456668 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In108456668 256))) (.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out108456668| |P2Thread1of1ForFork0_#t~ite38_Out108456668|))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In108456668 |P2Thread1of1ForFork0_#t~ite38_Out108456668|)) (and (not .cse2) (not .cse1) (= ~z$w_buff1~0_In108456668 |P2Thread1of1ForFork0_#t~ite38_Out108456668|) .cse0))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In108456668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108456668, ~z$w_buff1~0=~z$w_buff1~0_In108456668, ~z~0=~z~0_In108456668} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out108456668|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out108456668|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In108456668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108456668, ~z$w_buff1~0=~z$w_buff1~0_In108456668, ~z~0=~z~0_In108456668} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:48:58,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1874062753 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1874062753 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1874062753|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1874062753 |P2Thread1of1ForFork0_#t~ite40_Out-1874062753|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1874062753, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1874062753} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1874062753, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1874062753|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1874062753} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:48:58,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-131159957 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-131159957 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-131159957 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-131159957 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-131159957|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-131159957| ~z$w_buff1_used~0_In-131159957) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-131159957, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-131159957, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-131159957, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-131159957} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-131159957, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-131159957, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-131159957, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-131159957, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-131159957|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:48:58,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In979735797 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In979735797 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out979735797| ~z$r_buff0_thd3~0_In979735797) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out979735797|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In979735797, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In979735797} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In979735797, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In979735797, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out979735797|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:48:58,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In-1502058616 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1502058616 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1502058616 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1502058616 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1502058616| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1502058616 |P2Thread1of1ForFork0_#t~ite43_Out-1502058616|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1502058616, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1502058616, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1502058616, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1502058616} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1502058616|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1502058616, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1502058616, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1502058616, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1502058616} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:48:58,662 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_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_308 |v_P2Thread1of1ForFork0_#t~ite43_56|)) 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_308, ~__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-26 21:48:58,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In2112403588 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2112403588 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In2112403588 |P0Thread1of1ForFork1_#t~ite5_Out2112403588|)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out2112403588| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2112403588, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2112403588} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out2112403588|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2112403588, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2112403588} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:48:58,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-282244853 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-282244853 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-282244853 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-282244853 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-282244853| ~z$w_buff1_used~0_In-282244853) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out-282244853| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-282244853, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-282244853, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-282244853, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-282244853} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-282244853, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-282244853|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-282244853, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-282244853, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-282244853} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:48:58,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-815003296 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-815003296 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-815003296)) (and (= ~z$r_buff0_thd1~0_In-815003296 ~z$r_buff0_thd1~0_Out-815003296) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-815003296, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-815003296} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-815003296, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-815003296|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-815003296} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:48:58,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-247391996 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-247391996 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-247391996 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-247391996 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-247391996| ~z$r_buff1_thd1~0_In-247391996)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-247391996| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-247391996, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-247391996, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-247391996, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-247391996} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-247391996|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-247391996, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-247391996, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-247391996, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-247391996} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:48:58,664 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-26 21:48:58,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-834953641 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-834953641 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-834953641| ~z$w_buff0_used~0_In-834953641)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-834953641|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-834953641, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-834953641} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-834953641, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-834953641|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-834953641} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:48:58,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1388958673 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1388958673 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1388958673 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1388958673 256)))) (or (and (= ~z$w_buff1_used~0_In-1388958673 |P1Thread1of1ForFork2_#t~ite12_Out-1388958673|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1388958673|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1388958673, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1388958673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1388958673, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1388958673} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1388958673, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1388958673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1388958673, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1388958673|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1388958673} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:48:58,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1747314383 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1747314383 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1747314383| 0)) (and (= ~z$r_buff0_thd2~0_In1747314383 |P1Thread1of1ForFork2_#t~ite13_Out1747314383|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1747314383, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1747314383} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1747314383, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1747314383|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1747314383} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:48:58,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-679385893 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-679385893 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-679385893 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-679385893 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-679385893| ~z$r_buff1_thd2~0_In-679385893)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite14_Out-679385893| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-679385893, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-679385893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-679385893, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-679385893} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-679385893, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-679385893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-679385893, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-679385893|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-679385893} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:48:58,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= v_~z$r_buff1_thd2~0_188 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 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_188, ~__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-26 21:48:58,667 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-26 21:48:58,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-652139572 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-652139572 256) 0))) (or (and (= ~z~0_In-652139572 |ULTIMATE.start_main_#t~ite47_Out-652139572|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-652139572 |ULTIMATE.start_main_#t~ite47_Out-652139572|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-652139572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-652139572, ~z$w_buff1~0=~z$w_buff1~0_In-652139572, ~z~0=~z~0_In-652139572} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-652139572, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-652139572|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-652139572, ~z$w_buff1~0=~z$w_buff1~0_In-652139572, ~z~0=~z~0_In-652139572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:48:58,668 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-26 21:48:58,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-938424204 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-938424204 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-938424204|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-938424204 |ULTIMATE.start_main_#t~ite49_Out-938424204|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-938424204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-938424204} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-938424204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-938424204, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-938424204|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:48:58,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-586156292 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-586156292 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-586156292 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-586156292 256)))) (or (and (= ~z$w_buff1_used~0_In-586156292 |ULTIMATE.start_main_#t~ite50_Out-586156292|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-586156292|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-586156292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-586156292, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-586156292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-586156292} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-586156292|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-586156292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-586156292, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-586156292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-586156292} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:48:58,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1763870152 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1763870152 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-1763870152 |ULTIMATE.start_main_#t~ite51_Out-1763870152|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1763870152|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1763870152, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1763870152} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1763870152, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1763870152|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1763870152} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:48:58,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2118655465 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2118655465 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In2118655465 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In2118655465 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out2118655465| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out2118655465| ~z$r_buff1_thd0~0_In2118655465) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2118655465, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2118655465, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2118655465, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2118655465} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2118655465|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2118655465, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2118655465, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2118655465, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2118655465} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:48:58,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p1_EAX~0_22) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 2 v_~x~0_186)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186} OutVars{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, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186, 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-26 21:48:58,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:48:58 BasicIcfg [2019-12-26 21:48:58,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:48:58,759 INFO L168 Benchmark]: Toolchain (without parser) took 110840.67 ms. Allocated memory was 146.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 21:48:58,759 INFO L168 Benchmark]: CDTParser took 1.32 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 21:48:58,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.60 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 157.3 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:48:58,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.97 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:48:58,760 INFO L168 Benchmark]: Boogie Preprocessor took 40.94 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:48:58,762 INFO L168 Benchmark]: RCFGBuilder took 882.48 ms. Allocated memory is still 203.9 MB. Free memory was 152.5 MB in the beginning and 101.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:48:58,765 INFO L168 Benchmark]: TraceAbstraction took 109088.24 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 21:48:58,768 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.32 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.60 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 157.3 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.97 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.94 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 152.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 882.48 ms. Allocated memory is still 203.9 MB. Free memory was 152.5 MB in the beginning and 101.9 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109088.24 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7044 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 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(&t509, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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_p1_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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t510, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 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_p1_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=2, 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] [L829] FCALL, FORK 0 pthread_create(&t511, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, 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] [L780] 3 y = 1 [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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, 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] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=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: 108.7s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 35.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6964 SDtfs, 8218 SDslu, 24710 SDs, 0 SdLazy, 15754 SolverSat, 320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 36 SyntacticMatches, 22 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 4.0s 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: 41.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 252636 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1226 NumberOfCodeBlocks, 1226 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1132 ConstructedInterpolants, 0 QuantifiedInterpolants, 234513 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...