/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/mix002_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:10:26,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:10:26,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:10:26,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:10:26,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:10:26,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:10:26,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:10:26,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:10:26,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:10:26,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:10:26,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:10:26,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:10:26,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:10:26,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:10:26,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:10:26,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:10:26,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:10:26,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:10:26,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:10:26,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:10:26,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:10:26,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:10:26,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:10:26,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:10:26,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:10:26,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:10:26,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:10:26,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:10:26,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:10:26,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:10:26,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:10:26,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:10:26,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:10:26,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:10:26,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:10:26,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:10:26,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:10:26,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:10:26,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:10:26,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:10:26,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:10:26,745 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:10:26,780 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:10:26,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:10:26,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:10:26,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:10:26,782 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:10:26,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:10:26,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:10:26,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:10:26,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:10:26,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:10:26,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:10:26,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:10:26,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:10:26,784 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:10:26,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:10:26,784 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:10:26,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:10:26,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:10:26,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:10:26,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:10:26,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:10:26,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:10:26,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:10:26,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:10:26,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:10:26,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:10:26,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:10:26,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:10:26,788 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:10:26,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:10:27,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:10:27,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:10:27,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:10:27,075 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:10:27,078 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:10:27,079 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_tso.oepc.i [2019-12-26 21:10:27,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc827c4a4/bf4558e165a34d699a6aecdf5658b684/FLAG71e18ed7f [2019-12-26 21:10:27,677 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:10:27,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_tso.oepc.i [2019-12-26 21:10:27,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc827c4a4/bf4558e165a34d699a6aecdf5658b684/FLAG71e18ed7f [2019-12-26 21:10:27,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc827c4a4/bf4558e165a34d699a6aecdf5658b684 [2019-12-26 21:10:27,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:10:27,959 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:10:27,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:10:27,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:10:27,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:10:27,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:10:27" (1/1) ... [2019-12-26 21:10:27,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:27, skipping insertion in model container [2019-12-26 21:10:27,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:10:27" (1/1) ... [2019-12-26 21:10:27,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:10:28,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:10:28,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:10:28,510 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:10:28,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:10:28,677 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:10:28,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:28 WrapperNode [2019-12-26 21:10:28,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:10:28,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:10:28,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:10:28,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:10:28,688 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:10:28" (1/1) ... [2019-12-26 21:10:28,711 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:10:28" (1/1) ... [2019-12-26 21:10:28,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:10:28,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:10:28,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:10:28,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:10:28,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:28" (1/1) ... [2019-12-26 21:10:28,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:28" (1/1) ... [2019-12-26 21:10:28,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:28" (1/1) ... [2019-12-26 21:10:28,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:28" (1/1) ... [2019-12-26 21:10:28,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:28" (1/1) ... [2019-12-26 21:10:28,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:28" (1/1) ... [2019-12-26 21:10:28,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:28" (1/1) ... [2019-12-26 21:10:28,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:10:28,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:10:28,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:10:28,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:10:28,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:28" (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:10:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:10:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:10:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:10:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:10:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:10:28,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:10:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:10:28,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:10:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:10:28,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:10:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:10:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:10:28,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:10:28,869 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:10:29,642 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:10:29,643 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:10:29,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:10:29 BoogieIcfgContainer [2019-12-26 21:10:29,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:10:29,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:10:29,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:10:29,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:10:29,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:10:27" (1/3) ... [2019-12-26 21:10:29,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d77d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:10:29, skipping insertion in model container [2019-12-26 21:10:29,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:10:28" (2/3) ... [2019-12-26 21:10:29,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d77d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:10:29, skipping insertion in model container [2019-12-26 21:10:29,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:10:29" (3/3) ... [2019-12-26 21:10:29,653 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_tso.oepc.i [2019-12-26 21:10:29,664 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:10:29,665 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:10:29,675 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:10:29,676 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:10:29,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,722 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,736 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,737 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,781 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,781 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,827 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,828 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:10:29,853 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:10:29,874 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:10:29,875 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:10:29,875 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:10:29,875 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:10:29,875 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:10:29,875 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:10:29,876 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:10:29,876 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:10:29,892 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-26 21:10:29,894 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-26 21:10:30,019 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-26 21:10:30,020 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:10:30,038 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:10:30,061 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-26 21:10:30,144 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-26 21:10:30,144 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:10:30,152 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:10:30,173 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:10:30,174 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:10:35,653 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 21:10:35,832 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 21:10:35,996 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93316 [2019-12-26 21:10:35,996 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-26 21:10:36,000 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 104 transitions [2019-12-26 21:10:53,787 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-26 21:10:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-26 21:10:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:10:53,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:10:53,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:10:53,795 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:10:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:10:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash 922900, now seen corresponding path program 1 times [2019-12-26 21:10:53,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:10:53,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200088393] [2019-12-26 21:10:53,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:10:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:10:54,067 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:10:54,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200088393] [2019-12-26 21:10:54,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:10:54,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:10:54,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637903469] [2019-12-26 21:10:54,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:10:54,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:10:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:10:54,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:10:54,093 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-26 21:10:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:10:55,673 INFO L93 Difference]: Finished difference Result 119349 states and 508327 transitions. [2019-12-26 21:10:55,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:10:55,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:10:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:10:59,289 INFO L225 Difference]: With dead ends: 119349 [2019-12-26 21:10:59,290 INFO L226 Difference]: Without dead ends: 112420 [2019-12-26 21:10:59,292 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:11:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2019-12-26 21:11:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2019-12-26 21:11:06,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112420 states. [2019-12-26 21:11:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 478219 transitions. [2019-12-26 21:11:07,360 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 478219 transitions. Word has length 3 [2019-12-26 21:11:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:07,361 INFO L462 AbstractCegarLoop]: Abstraction has 112420 states and 478219 transitions. [2019-12-26 21:11:07,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 478219 transitions. [2019-12-26 21:11:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:11:07,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:07,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:07,366 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:11:07,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:07,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1739393843, now seen corresponding path program 1 times [2019-12-26 21:11:07,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:07,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158806296] [2019-12-26 21:11:07,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:07,451 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:11:07,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158806296] [2019-12-26 21:11:07,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:07,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:07,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015886272] [2019-12-26 21:11:07,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:11:07,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:07,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:11:07,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:11:07,455 INFO L87 Difference]: Start difference. First operand 112420 states and 478219 transitions. Second operand 4 states. [2019-12-26 21:11:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:12,327 INFO L93 Difference]: Finished difference Result 179210 states and 732067 transitions. [2019-12-26 21:11:12,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:11:12,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:11:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:12,924 INFO L225 Difference]: With dead ends: 179210 [2019-12-26 21:11:12,924 INFO L226 Difference]: Without dead ends: 179161 [2019-12-26 21:11:12,925 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:11:19,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179161 states. [2019-12-26 21:11:27,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179161 to 162301. [2019-12-26 21:11:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162301 states. [2019-12-26 21:11:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162301 states to 162301 states and 672031 transitions. [2019-12-26 21:11:28,456 INFO L78 Accepts]: Start accepts. Automaton has 162301 states and 672031 transitions. Word has length 11 [2019-12-26 21:11:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:28,457 INFO L462 AbstractCegarLoop]: Abstraction has 162301 states and 672031 transitions. [2019-12-26 21:11:28,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:11:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 162301 states and 672031 transitions. [2019-12-26 21:11:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:11:28,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:28,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:28,463 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:11:28,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:28,464 INFO L82 PathProgramCache]: Analyzing trace with hash 53844596, now seen corresponding path program 1 times [2019-12-26 21:11:28,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:28,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364487964] [2019-12-26 21:11:28,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:28,535 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:11:28,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364487964] [2019-12-26 21:11:28,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:28,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:28,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040215501] [2019-12-26 21:11:28,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:28,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:28,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:28,538 INFO L87 Difference]: Start difference. First operand 162301 states and 672031 transitions. Second operand 3 states. [2019-12-26 21:11:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:28,676 INFO L93 Difference]: Finished difference Result 34811 states and 113031 transitions. [2019-12-26 21:11:28,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:28,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:11:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:28,776 INFO L225 Difference]: With dead ends: 34811 [2019-12-26 21:11:28,777 INFO L226 Difference]: Without dead ends: 34811 [2019-12-26 21:11:28,777 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:11:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34811 states. [2019-12-26 21:11:29,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34811 to 34811. [2019-12-26 21:11:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34811 states. [2019-12-26 21:11:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34811 states to 34811 states and 113031 transitions. [2019-12-26 21:11:29,504 INFO L78 Accepts]: Start accepts. Automaton has 34811 states and 113031 transitions. Word has length 13 [2019-12-26 21:11:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:29,504 INFO L462 AbstractCegarLoop]: Abstraction has 34811 states and 113031 transitions. [2019-12-26 21:11:29,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 34811 states and 113031 transitions. [2019-12-26 21:11:29,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:11:29,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:29,508 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:11:29,508 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:11:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2104175705, now seen corresponding path program 1 times [2019-12-26 21:11:29,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:29,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634165331] [2019-12-26 21:11:29,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:29,597 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:11:29,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634165331] [2019-12-26 21:11:29,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:29,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:29,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64509396] [2019-12-26 21:11:29,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:11:29,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:29,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:11:29,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:29,600 INFO L87 Difference]: Start difference. First operand 34811 states and 113031 transitions. Second operand 5 states. [2019-12-26 21:11:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:32,417 INFO L93 Difference]: Finished difference Result 48236 states and 154913 transitions. [2019-12-26 21:11:32,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:11:32,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 21:11:32,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:32,507 INFO L225 Difference]: With dead ends: 48236 [2019-12-26 21:11:32,508 INFO L226 Difference]: Without dead ends: 48236 [2019-12-26 21:11:32,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-26 21:11:33,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 41215. [2019-12-26 21:11:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41215 states. [2019-12-26 21:11:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41215 states to 41215 states and 133442 transitions. [2019-12-26 21:11:33,324 INFO L78 Accepts]: Start accepts. Automaton has 41215 states and 133442 transitions. Word has length 16 [2019-12-26 21:11:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:33,325 INFO L462 AbstractCegarLoop]: Abstraction has 41215 states and 133442 transitions. [2019-12-26 21:11:33,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:11:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 41215 states and 133442 transitions. [2019-12-26 21:11:33,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:11:33,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:33,336 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:11:33,336 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:11:33,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:33,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1566659883, now seen corresponding path program 1 times [2019-12-26 21:11:33,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:33,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39726824] [2019-12-26 21:11:33,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:33,433 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:11:33,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39726824] [2019-12-26 21:11:33,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:33,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:11:33,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041373595] [2019-12-26 21:11:33,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:11:33,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:11:33,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:11:33,436 INFO L87 Difference]: Start difference. First operand 41215 states and 133442 transitions. Second operand 6 states. [2019-12-26 21:11:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:34,353 INFO L93 Difference]: Finished difference Result 62182 states and 196414 transitions. [2019-12-26 21:11:34,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:11:34,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 21:11:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:34,463 INFO L225 Difference]: With dead ends: 62182 [2019-12-26 21:11:34,463 INFO L226 Difference]: Without dead ends: 62175 [2019-12-26 21:11:34,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:11:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62175 states. [2019-12-26 21:11:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62175 to 40995. [2019-12-26 21:11:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40995 states. [2019-12-26 21:11:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40995 states to 40995 states and 132031 transitions. [2019-12-26 21:11:35,730 INFO L78 Accepts]: Start accepts. Automaton has 40995 states and 132031 transitions. Word has length 22 [2019-12-26 21:11:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:35,730 INFO L462 AbstractCegarLoop]: Abstraction has 40995 states and 132031 transitions. [2019-12-26 21:11:35,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:11:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 40995 states and 132031 transitions. [2019-12-26 21:11:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:11:35,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:35,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:35,745 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:11:35,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:35,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1076429505, now seen corresponding path program 1 times [2019-12-26 21:11:35,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:35,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496598054] [2019-12-26 21:11:35,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:35,820 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:11:35,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496598054] [2019-12-26 21:11:35,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:35,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:35,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545210707] [2019-12-26 21:11:35,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:11:35,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:35,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:11:35,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:11:35,823 INFO L87 Difference]: Start difference. First operand 40995 states and 132031 transitions. Second operand 4 states. [2019-12-26 21:11:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:35,881 INFO L93 Difference]: Finished difference Result 16196 states and 49196 transitions. [2019-12-26 21:11:35,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:11:35,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:11:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:35,903 INFO L225 Difference]: With dead ends: 16196 [2019-12-26 21:11:35,903 INFO L226 Difference]: Without dead ends: 16196 [2019-12-26 21:11:35,903 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:11:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16196 states. [2019-12-26 21:11:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16196 to 15833. [2019-12-26 21:11:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15833 states. [2019-12-26 21:11:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15833 states to 15833 states and 48160 transitions. [2019-12-26 21:11:36,149 INFO L78 Accepts]: Start accepts. Automaton has 15833 states and 48160 transitions. Word has length 25 [2019-12-26 21:11:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:36,149 INFO L462 AbstractCegarLoop]: Abstraction has 15833 states and 48160 transitions. [2019-12-26 21:11:36,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:11:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 15833 states and 48160 transitions. [2019-12-26 21:11:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:11:36,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:36,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:36,160 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:11:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:36,160 INFO L82 PathProgramCache]: Analyzing trace with hash -877586735, now seen corresponding path program 1 times [2019-12-26 21:11:36,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:36,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558214310] [2019-12-26 21:11:36,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:36,212 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:11:36,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558214310] [2019-12-26 21:11:36,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:36,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:36,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628846519] [2019-12-26 21:11:36,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:36,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:36,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:36,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:36,215 INFO L87 Difference]: Start difference. First operand 15833 states and 48160 transitions. Second operand 3 states. [2019-12-26 21:11:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:36,319 INFO L93 Difference]: Finished difference Result 23073 states and 68792 transitions. [2019-12-26 21:11:36,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:36,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:11:36,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:36,349 INFO L225 Difference]: With dead ends: 23073 [2019-12-26 21:11:36,349 INFO L226 Difference]: Without dead ends: 23073 [2019-12-26 21:11:36,350 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:11:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2019-12-26 21:11:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 17600. [2019-12-26 21:11:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-12-26 21:11:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 53010 transitions. [2019-12-26 21:11:36,658 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 53010 transitions. Word has length 27 [2019-12-26 21:11:36,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:36,658 INFO L462 AbstractCegarLoop]: Abstraction has 17600 states and 53010 transitions. [2019-12-26 21:11:36,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 53010 transitions. [2019-12-26 21:11:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:11:36,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:36,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:36,671 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:11:36,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:36,671 INFO L82 PathProgramCache]: Analyzing trace with hash -603523497, now seen corresponding path program 1 times [2019-12-26 21:11:36,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:36,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326543134] [2019-12-26 21:11:36,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:36,748 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:11:36,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326543134] [2019-12-26 21:11:36,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:36,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:11:36,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675487317] [2019-12-26 21:11:36,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:11:36,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:36,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:11:36,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:11:36,751 INFO L87 Difference]: Start difference. First operand 17600 states and 53010 transitions. Second operand 6 states. [2019-12-26 21:11:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:37,269 INFO L93 Difference]: Finished difference Result 24767 states and 72789 transitions. [2019-12-26 21:11:37,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:11:37,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:11:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:37,303 INFO L225 Difference]: With dead ends: 24767 [2019-12-26 21:11:37,303 INFO L226 Difference]: Without dead ends: 24767 [2019-12-26 21:11:37,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:11:37,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-26 21:11:37,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 20286. [2019-12-26 21:11:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20286 states. [2019-12-26 21:11:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20286 states to 20286 states and 60759 transitions. [2019-12-26 21:11:37,818 INFO L78 Accepts]: Start accepts. Automaton has 20286 states and 60759 transitions. Word has length 27 [2019-12-26 21:11:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:37,818 INFO L462 AbstractCegarLoop]: Abstraction has 20286 states and 60759 transitions. [2019-12-26 21:11:37,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:11:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 20286 states and 60759 transitions. [2019-12-26 21:11:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:11:37,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:37,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:37,841 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:11:37,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash 94968403, now seen corresponding path program 1 times [2019-12-26 21:11:37,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:37,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114629011] [2019-12-26 21:11:37,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:37,947 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:11:37,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114629011] [2019-12-26 21:11:37,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:37,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:11:37,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952821407] [2019-12-26 21:11:37,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:11:37,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:37,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:11:37,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:37,950 INFO L87 Difference]: Start difference. First operand 20286 states and 60759 transitions. Second operand 7 states. [2019-12-26 21:11:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:39,238 INFO L93 Difference]: Finished difference Result 27601 states and 80773 transitions. [2019-12-26 21:11:39,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:11:39,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 21:11:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:39,276 INFO L225 Difference]: With dead ends: 27601 [2019-12-26 21:11:39,276 INFO L226 Difference]: Without dead ends: 27601 [2019-12-26 21:11:39,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:11:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2019-12-26 21:11:39,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 18412. [2019-12-26 21:11:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18412 states. [2019-12-26 21:11:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18412 states to 18412 states and 55362 transitions. [2019-12-26 21:11:39,608 INFO L78 Accepts]: Start accepts. Automaton has 18412 states and 55362 transitions. Word has length 33 [2019-12-26 21:11:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:39,608 INFO L462 AbstractCegarLoop]: Abstraction has 18412 states and 55362 transitions. [2019-12-26 21:11:39,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:11:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 18412 states and 55362 transitions. [2019-12-26 21:11:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:11:39,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:39,633 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:11:39,634 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:11:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash 994852703, now seen corresponding path program 1 times [2019-12-26 21:11:39,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:39,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666800904] [2019-12-26 21:11:39,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:39,697 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:11:39,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666800904] [2019-12-26 21:11:39,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:39,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:11:39,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208764783] [2019-12-26 21:11:39,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:39,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:39,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:39,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:39,700 INFO L87 Difference]: Start difference. First operand 18412 states and 55362 transitions. Second operand 3 states. [2019-12-26 21:11:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:39,773 INFO L93 Difference]: Finished difference Result 18411 states and 55360 transitions. [2019-12-26 21:11:39,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:39,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:11:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:39,799 INFO L225 Difference]: With dead ends: 18411 [2019-12-26 21:11:39,800 INFO L226 Difference]: Without dead ends: 18411 [2019-12-26 21:11:39,800 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:11:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2019-12-26 21:11:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 18411. [2019-12-26 21:11:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18411 states. [2019-12-26 21:11:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18411 states to 18411 states and 55360 transitions. [2019-12-26 21:11:40,074 INFO L78 Accepts]: Start accepts. Automaton has 18411 states and 55360 transitions. Word has length 39 [2019-12-26 21:11:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:40,075 INFO L462 AbstractCegarLoop]: Abstraction has 18411 states and 55360 transitions. [2019-12-26 21:11:40,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 18411 states and 55360 transitions. [2019-12-26 21:11:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:11:40,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:40,098 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:11:40,098 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:11:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash 467911076, now seen corresponding path program 1 times [2019-12-26 21:11:40,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:40,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545963859] [2019-12-26 21:11:40,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:40,209 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:11:40,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545963859] [2019-12-26 21:11:40,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:40,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:40,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353139194] [2019-12-26 21:11:40,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:40,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:40,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:40,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:40,213 INFO L87 Difference]: Start difference. First operand 18411 states and 55360 transitions. Second operand 3 states. [2019-12-26 21:11:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:40,301 INFO L93 Difference]: Finished difference Result 18325 states and 55099 transitions. [2019-12-26 21:11:40,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:40,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 21:11:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:40,333 INFO L225 Difference]: With dead ends: 18325 [2019-12-26 21:11:40,333 INFO L226 Difference]: Without dead ends: 18325 [2019-12-26 21:11:40,333 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:11:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18325 states. [2019-12-26 21:11:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18325 to 16323. [2019-12-26 21:11:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16323 states. [2019-12-26 21:11:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16323 states to 16323 states and 49617 transitions. [2019-12-26 21:11:40,603 INFO L78 Accepts]: Start accepts. Automaton has 16323 states and 49617 transitions. Word has length 40 [2019-12-26 21:11:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:40,603 INFO L462 AbstractCegarLoop]: Abstraction has 16323 states and 49617 transitions. [2019-12-26 21:11:40,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 16323 states and 49617 transitions. [2019-12-26 21:11:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 21:11:40,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:40,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:40,620 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:11:40,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:40,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1873584483, now seen corresponding path program 1 times [2019-12-26 21:11:40,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:40,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434117522] [2019-12-26 21:11:40,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:11:40,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434117522] [2019-12-26 21:11:40,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:40,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:11:40,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246197403] [2019-12-26 21:11:40,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:11:40,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:40,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:11:40,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:40,688 INFO L87 Difference]: Start difference. First operand 16323 states and 49617 transitions. Second operand 5 states. [2019-12-26 21:11:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:40,790 INFO L93 Difference]: Finished difference Result 15143 states and 47024 transitions. [2019-12-26 21:11:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:11:40,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-26 21:11:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:40,819 INFO L225 Difference]: With dead ends: 15143 [2019-12-26 21:11:40,820 INFO L226 Difference]: Without dead ends: 15143 [2019-12-26 21:11:40,820 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:11:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-26 21:11:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 15143. [2019-12-26 21:11:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-12-26 21:11:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 47024 transitions. [2019-12-26 21:11:41,222 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 47024 transitions. Word has length 41 [2019-12-26 21:11:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:41,222 INFO L462 AbstractCegarLoop]: Abstraction has 15143 states and 47024 transitions. [2019-12-26 21:11:41,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:11:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 47024 transitions. [2019-12-26 21:11:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:41,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:41,239 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:11:41,239 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:11:41,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:41,240 INFO L82 PathProgramCache]: Analyzing trace with hash 628999064, now seen corresponding path program 1 times [2019-12-26 21:11:41,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:41,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631234353] [2019-12-26 21:11:41,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:41,314 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:11:41,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631234353] [2019-12-26 21:11:41,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:41,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:41,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522051789] [2019-12-26 21:11:41,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:41,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:41,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:41,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:41,316 INFO L87 Difference]: Start difference. First operand 15143 states and 47024 transitions. Second operand 3 states. [2019-12-26 21:11:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:41,426 INFO L93 Difference]: Finished difference Result 19655 states and 59985 transitions. [2019-12-26 21:11:41,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:41,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:11:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:41,464 INFO L225 Difference]: With dead ends: 19655 [2019-12-26 21:11:41,464 INFO L226 Difference]: Without dead ends: 19655 [2019-12-26 21:11:41,469 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:11:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19655 states. [2019-12-26 21:11:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19655 to 14961. [2019-12-26 21:11:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14961 states. [2019-12-26 21:11:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14961 states to 14961 states and 45870 transitions. [2019-12-26 21:11:41,884 INFO L78 Accepts]: Start accepts. Automaton has 14961 states and 45870 transitions. Word has length 65 [2019-12-26 21:11:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:41,884 INFO L462 AbstractCegarLoop]: Abstraction has 14961 states and 45870 transitions. [2019-12-26 21:11:41,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 14961 states and 45870 transitions. [2019-12-26 21:11:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:41,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:41,906 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:11:41,906 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:11:41,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:41,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1958678932, now seen corresponding path program 1 times [2019-12-26 21:11:41,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:41,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937592737] [2019-12-26 21:11:41,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:41,996 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:11:41,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937592737] [2019-12-26 21:11:41,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:41,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:11:41,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630436286] [2019-12-26 21:11:41,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:11:41,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:41,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:11:41,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:41,998 INFO L87 Difference]: Start difference. First operand 14961 states and 45870 transitions. Second operand 7 states. [2019-12-26 21:11:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:42,489 INFO L93 Difference]: Finished difference Result 43069 states and 131367 transitions. [2019-12-26 21:11:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:11:42,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:11:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:42,536 INFO L225 Difference]: With dead ends: 43069 [2019-12-26 21:11:42,536 INFO L226 Difference]: Without dead ends: 33469 [2019-12-26 21:11:42,536 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:11:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33469 states. [2019-12-26 21:11:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33469 to 18596. [2019-12-26 21:11:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18596 states. [2019-12-26 21:11:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18596 states to 18596 states and 57138 transitions. [2019-12-26 21:11:42,953 INFO L78 Accepts]: Start accepts. Automaton has 18596 states and 57138 transitions. Word has length 65 [2019-12-26 21:11:42,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:42,953 INFO L462 AbstractCegarLoop]: Abstraction has 18596 states and 57138 transitions. [2019-12-26 21:11:42,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:11:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 18596 states and 57138 transitions. [2019-12-26 21:11:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:42,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:42,978 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:11:42,978 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:11:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:42,979 INFO L82 PathProgramCache]: Analyzing trace with hash -29541862, now seen corresponding path program 2 times [2019-12-26 21:11:42,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:42,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084059256] [2019-12-26 21:11:42,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:43,079 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:11:43,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084059256] [2019-12-26 21:11:43,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:43,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:11:43,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893588847] [2019-12-26 21:11:43,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:11:43,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:43,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:11:43,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:43,082 INFO L87 Difference]: Start difference. First operand 18596 states and 57138 transitions. Second operand 7 states. [2019-12-26 21:11:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:43,513 INFO L93 Difference]: Finished difference Result 48601 states and 146797 transitions. [2019-12-26 21:11:43,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:11:43,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:11:43,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:43,580 INFO L225 Difference]: With dead ends: 48601 [2019-12-26 21:11:43,580 INFO L226 Difference]: Without dead ends: 35759 [2019-12-26 21:11:43,581 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:11:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35759 states. [2019-12-26 21:11:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35759 to 21981. [2019-12-26 21:11:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21981 states. [2019-12-26 21:11:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21981 states to 21981 states and 67224 transitions. [2019-12-26 21:11:44,050 INFO L78 Accepts]: Start accepts. Automaton has 21981 states and 67224 transitions. Word has length 65 [2019-12-26 21:11:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:44,051 INFO L462 AbstractCegarLoop]: Abstraction has 21981 states and 67224 transitions. [2019-12-26 21:11:44,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:11:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 21981 states and 67224 transitions. [2019-12-26 21:11:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:44,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:44,255 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:11:44,255 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:11:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1604322860, now seen corresponding path program 3 times [2019-12-26 21:11:44,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:44,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946171702] [2019-12-26 21:11:44,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:44,433 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:11:44,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946171702] [2019-12-26 21:11:44,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:44,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:11:44,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446097265] [2019-12-26 21:11:44,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:11:44,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:44,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:11:44,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:44,435 INFO L87 Difference]: Start difference. First operand 21981 states and 67224 transitions. Second operand 9 states. [2019-12-26 21:11:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:45,784 INFO L93 Difference]: Finished difference Result 65932 states and 199427 transitions. [2019-12-26 21:11:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:11:45,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:11:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:45,874 INFO L225 Difference]: With dead ends: 65932 [2019-12-26 21:11:45,874 INFO L226 Difference]: Without dead ends: 63310 [2019-12-26 21:11:45,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:11:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-26 21:11:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 22137. [2019-12-26 21:11:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22137 states. [2019-12-26 21:11:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22137 states to 22137 states and 67886 transitions. [2019-12-26 21:11:46,528 INFO L78 Accepts]: Start accepts. Automaton has 22137 states and 67886 transitions. Word has length 65 [2019-12-26 21:11:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:46,528 INFO L462 AbstractCegarLoop]: Abstraction has 22137 states and 67886 transitions. [2019-12-26 21:11:46,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:11:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 22137 states and 67886 transitions. [2019-12-26 21:11:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:46,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:46,549 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:11:46,549 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:11:46,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2017880016, now seen corresponding path program 4 times [2019-12-26 21:11:46,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:46,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862763774] [2019-12-26 21:11:46,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:46,662 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:11:46,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862763774] [2019-12-26 21:11:46,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:46,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:11:46,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097335652] [2019-12-26 21:11:46,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:11:46,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:46,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:11:46,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:46,664 INFO L87 Difference]: Start difference. First operand 22137 states and 67886 transitions. Second operand 9 states. [2019-12-26 21:11:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:47,875 INFO L93 Difference]: Finished difference Result 78329 states and 236465 transitions. [2019-12-26 21:11:47,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:11:47,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:11:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:47,984 INFO L225 Difference]: With dead ends: 78329 [2019-12-26 21:11:47,984 INFO L226 Difference]: Without dead ends: 75771 [2019-12-26 21:11:47,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:11:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75771 states. [2019-12-26 21:11:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75771 to 22174. [2019-12-26 21:11:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22174 states. [2019-12-26 21:11:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22174 states to 22174 states and 68084 transitions. [2019-12-26 21:11:48,930 INFO L78 Accepts]: Start accepts. Automaton has 22174 states and 68084 transitions. Word has length 65 [2019-12-26 21:11:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:48,931 INFO L462 AbstractCegarLoop]: Abstraction has 22174 states and 68084 transitions. [2019-12-26 21:11:48,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:11:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 22174 states and 68084 transitions. [2019-12-26 21:11:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:11:48,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:48,952 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:11:48,953 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:11:48,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash -841108452, now seen corresponding path program 5 times [2019-12-26 21:11:48,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:48,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422426299] [2019-12-26 21:11:48,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:49,009 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:11:49,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422426299] [2019-12-26 21:11:49,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:49,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:49,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552226996] [2019-12-26 21:11:49,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:49,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:49,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:49,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:49,011 INFO L87 Difference]: Start difference. First operand 22174 states and 68084 transitions. Second operand 3 states. [2019-12-26 21:11:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:49,136 INFO L93 Difference]: Finished difference Result 25241 states and 77567 transitions. [2019-12-26 21:11:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:49,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:11:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:49,169 INFO L225 Difference]: With dead ends: 25241 [2019-12-26 21:11:49,170 INFO L226 Difference]: Without dead ends: 25241 [2019-12-26 21:11:49,170 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:11:49,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25241 states. [2019-12-26 21:11:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25241 to 21050. [2019-12-26 21:11:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21050 states. [2019-12-26 21:11:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21050 states to 21050 states and 65371 transitions. [2019-12-26 21:11:49,515 INFO L78 Accepts]: Start accepts. Automaton has 21050 states and 65371 transitions. Word has length 65 [2019-12-26 21:11:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:49,515 INFO L462 AbstractCegarLoop]: Abstraction has 21050 states and 65371 transitions. [2019-12-26 21:11:49,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 21050 states and 65371 transitions. [2019-12-26 21:11:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:49,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:49,538 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:11:49,538 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:11:49,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:49,538 INFO L82 PathProgramCache]: Analyzing trace with hash -23971085, now seen corresponding path program 1 times [2019-12-26 21:11:49,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:49,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111580492] [2019-12-26 21:11:49,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:49,624 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:11:49,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111580492] [2019-12-26 21:11:49,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:49,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:11:49,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760346200] [2019-12-26 21:11:49,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:11:49,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:49,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:11:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:11:49,626 INFO L87 Difference]: Start difference. First operand 21050 states and 65371 transitions. Second operand 8 states. [2019-12-26 21:11:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:50,410 INFO L93 Difference]: Finished difference Result 52001 states and 158465 transitions. [2019-12-26 21:11:50,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:11:50,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-26 21:11:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:50,477 INFO L225 Difference]: With dead ends: 52001 [2019-12-26 21:11:50,477 INFO L226 Difference]: Without dead ends: 48845 [2019-12-26 21:11:50,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:11:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48845 states. [2019-12-26 21:11:50,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48845 to 21134. [2019-12-26 21:11:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21134 states. [2019-12-26 21:11:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21134 states to 21134 states and 65711 transitions. [2019-12-26 21:11:50,997 INFO L78 Accepts]: Start accepts. Automaton has 21134 states and 65711 transitions. Word has length 66 [2019-12-26 21:11:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:50,997 INFO L462 AbstractCegarLoop]: Abstraction has 21134 states and 65711 transitions. [2019-12-26 21:11:50,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:11:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 21134 states and 65711 transitions. [2019-12-26 21:11:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:51,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:51,021 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:11:51,021 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:11:51,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:51,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1713623309, now seen corresponding path program 2 times [2019-12-26 21:11:51,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:51,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536893408] [2019-12-26 21:11:51,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:51,121 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:11:51,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536893408] [2019-12-26 21:11:51,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:51,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:11:51,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007364686] [2019-12-26 21:11:51,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:11:51,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:51,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:11:51,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:51,123 INFO L87 Difference]: Start difference. First operand 21134 states and 65711 transitions. Second operand 9 states. [2019-12-26 21:11:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:52,696 INFO L93 Difference]: Finished difference Result 59225 states and 178920 transitions. [2019-12-26 21:11:52,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:11:52,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 21:11:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:52,768 INFO L225 Difference]: With dead ends: 59225 [2019-12-26 21:11:52,769 INFO L226 Difference]: Without dead ends: 56069 [2019-12-26 21:11:52,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:11:52,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56069 states. [2019-12-26 21:11:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56069 to 21156. [2019-12-26 21:11:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21156 states. [2019-12-26 21:11:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21156 states to 21156 states and 65782 transitions. [2019-12-26 21:11:53,311 INFO L78 Accepts]: Start accepts. Automaton has 21156 states and 65782 transitions. Word has length 66 [2019-12-26 21:11:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:53,311 INFO L462 AbstractCegarLoop]: Abstraction has 21156 states and 65782 transitions. [2019-12-26 21:11:53,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:11:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 21156 states and 65782 transitions. [2019-12-26 21:11:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:53,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:53,332 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:11:53,332 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:11:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1583227917, now seen corresponding path program 3 times [2019-12-26 21:11:53,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:53,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26974770] [2019-12-26 21:11:53,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:53,455 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:11:53,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26974770] [2019-12-26 21:11:53,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:53,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:11:53,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309549002] [2019-12-26 21:11:53,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:11:53,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:53,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:11:53,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:53,458 INFO L87 Difference]: Start difference. First operand 21156 states and 65782 transitions. Second operand 9 states. [2019-12-26 21:11:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:54,756 INFO L93 Difference]: Finished difference Result 65701 states and 198070 transitions. [2019-12-26 21:11:54,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:11:54,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 21:11:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:54,845 INFO L225 Difference]: With dead ends: 65701 [2019-12-26 21:11:54,845 INFO L226 Difference]: Without dead ends: 62568 [2019-12-26 21:11:54,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:11:55,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62568 states. [2019-12-26 21:11:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62568 to 21037. [2019-12-26 21:11:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21037 states. [2019-12-26 21:11:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21037 states to 21037 states and 65199 transitions. [2019-12-26 21:11:55,455 INFO L78 Accepts]: Start accepts. Automaton has 21037 states and 65199 transitions. Word has length 66 [2019-12-26 21:11:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:55,455 INFO L462 AbstractCegarLoop]: Abstraction has 21037 states and 65199 transitions. [2019-12-26 21:11:55,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:11:55,455 INFO L276 IsEmpty]: Start isEmpty. Operand 21037 states and 65199 transitions. [2019-12-26 21:11:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:55,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:55,478 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:11:55,478 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:11:55,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:55,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1805047887, now seen corresponding path program 4 times [2019-12-26 21:11:55,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:55,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172038932] [2019-12-26 21:11:55,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:55,613 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:11:55,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172038932] [2019-12-26 21:11:55,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:55,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:11:55,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726741829] [2019-12-26 21:11:55,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:11:55,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:55,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:11:55,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:11:55,615 INFO L87 Difference]: Start difference. First operand 21037 states and 65199 transitions. Second operand 7 states. [2019-12-26 21:11:56,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:56,528 INFO L93 Difference]: Finished difference Result 33222 states and 101569 transitions. [2019-12-26 21:11:56,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 21:11:56,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 21:11:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:56,576 INFO L225 Difference]: With dead ends: 33222 [2019-12-26 21:11:56,577 INFO L226 Difference]: Without dead ends: 33222 [2019-12-26 21:11:56,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33222 states. [2019-12-26 21:11:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33222 to 20376. [2019-12-26 21:11:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20376 states. [2019-12-26 21:11:57,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20376 states to 20376 states and 62283 transitions. [2019-12-26 21:11:57,147 INFO L78 Accepts]: Start accepts. Automaton has 20376 states and 62283 transitions. Word has length 66 [2019-12-26 21:11:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:57,148 INFO L462 AbstractCegarLoop]: Abstraction has 20376 states and 62283 transitions. [2019-12-26 21:11:57,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:11:57,148 INFO L276 IsEmpty]: Start isEmpty. Operand 20376 states and 62283 transitions. [2019-12-26 21:11:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:57,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:57,172 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:11:57,172 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:11:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:57,172 INFO L82 PathProgramCache]: Analyzing trace with hash -707932787, now seen corresponding path program 1 times [2019-12-26 21:11:57,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:57,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128882244] [2019-12-26 21:11:57,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:57,249 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:11:57,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128882244] [2019-12-26 21:11:57,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:57,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:11:57,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683090523] [2019-12-26 21:11:57,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:11:57,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:57,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:11:57,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:11:57,251 INFO L87 Difference]: Start difference. First operand 20376 states and 62283 transitions. Second operand 4 states. [2019-12-26 21:11:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:57,361 INFO L93 Difference]: Finished difference Result 20191 states and 61547 transitions. [2019-12-26 21:11:57,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:11:57,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 21:11:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:57,386 INFO L225 Difference]: With dead ends: 20191 [2019-12-26 21:11:57,387 INFO L226 Difference]: Without dead ends: 20191 [2019-12-26 21:11:57,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:11:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2019-12-26 21:11:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 18496. [2019-12-26 21:11:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18496 states. [2019-12-26 21:11:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18496 states to 18496 states and 56455 transitions. [2019-12-26 21:11:57,679 INFO L78 Accepts]: Start accepts. Automaton has 18496 states and 56455 transitions. Word has length 66 [2019-12-26 21:11:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:57,680 INFO L462 AbstractCegarLoop]: Abstraction has 18496 states and 56455 transitions. [2019-12-26 21:11:57,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:11:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 18496 states and 56455 transitions. [2019-12-26 21:11:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:11:57,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:57,703 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:11:57,703 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:11:57,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:57,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1506873112, now seen corresponding path program 1 times [2019-12-26 21:11:57,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:57,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450414335] [2019-12-26 21:11:57,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:57,767 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:11:57,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450414335] [2019-12-26 21:11:57,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:57,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:11:57,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190299502] [2019-12-26 21:11:57,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:11:57,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:57,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:11:57,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:11:57,769 INFO L87 Difference]: Start difference. First operand 18496 states and 56455 transitions. Second operand 3 states. [2019-12-26 21:11:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:57,841 INFO L93 Difference]: Finished difference Result 16117 states and 48226 transitions. [2019-12-26 21:11:57,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:11:57,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:11:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:57,868 INFO L225 Difference]: With dead ends: 16117 [2019-12-26 21:11:57,868 INFO L226 Difference]: Without dead ends: 16117 [2019-12-26 21:11:57,869 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:11:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16117 states. [2019-12-26 21:11:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16117 to 14647. [2019-12-26 21:11:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14647 states. [2019-12-26 21:11:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14647 states to 14647 states and 43816 transitions. [2019-12-26 21:11:58,146 INFO L78 Accepts]: Start accepts. Automaton has 14647 states and 43816 transitions. Word has length 66 [2019-12-26 21:11:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:58,147 INFO L462 AbstractCegarLoop]: Abstraction has 14647 states and 43816 transitions. [2019-12-26 21:11:58,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:11:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 14647 states and 43816 transitions. [2019-12-26 21:11:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:58,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:58,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:58,161 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:11:58,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:58,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1717710349, now seen corresponding path program 1 times [2019-12-26 21:11:58,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:58,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386875607] [2019-12-26 21:11:58,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:11:58,261 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:11:58,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386875607] [2019-12-26 21:11:58,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:11:58,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:11:58,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150987226] [2019-12-26 21:11:58,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:11:58,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:11:58,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:11:58,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:11:58,263 INFO L87 Difference]: Start difference. First operand 14647 states and 43816 transitions. Second operand 9 states. [2019-12-26 21:11:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:11:59,584 INFO L93 Difference]: Finished difference Result 28454 states and 84160 transitions. [2019-12-26 21:11:59,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 21:11:59,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-26 21:11:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:11:59,615 INFO L225 Difference]: With dead ends: 28454 [2019-12-26 21:11:59,615 INFO L226 Difference]: Without dead ends: 23657 [2019-12-26 21:11:59,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:11:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23657 states. [2019-12-26 21:11:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23657 to 15071. [2019-12-26 21:11:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15071 states. [2019-12-26 21:11:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15071 states to 15071 states and 44798 transitions. [2019-12-26 21:11:59,897 INFO L78 Accepts]: Start accepts. Automaton has 15071 states and 44798 transitions. Word has length 67 [2019-12-26 21:11:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:11:59,897 INFO L462 AbstractCegarLoop]: Abstraction has 15071 states and 44798 transitions. [2019-12-26 21:11:59,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:11:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 15071 states and 44798 transitions. [2019-12-26 21:11:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:11:59,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:11:59,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:11:59,913 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:11:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:11:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1715738515, now seen corresponding path program 2 times [2019-12-26 21:11:59,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:11:59,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524046062] [2019-12-26 21:11:59,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:11:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:00,074 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:12:00,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524046062] [2019-12-26 21:12:00,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:00,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:00,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932445322] [2019-12-26 21:12:00,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:00,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:00,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:00,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:00,076 INFO L87 Difference]: Start difference. First operand 15071 states and 44798 transitions. Second operand 11 states. [2019-12-26 21:12:01,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:01,148 INFO L93 Difference]: Finished difference Result 31554 states and 93034 transitions. [2019-12-26 21:12:01,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 21:12:01,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:12:01,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:01,183 INFO L225 Difference]: With dead ends: 31554 [2019-12-26 21:12:01,183 INFO L226 Difference]: Without dead ends: 25553 [2019-12-26 21:12:01,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 21:12:01,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25553 states. [2019-12-26 21:12:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25553 to 14407. [2019-12-26 21:12:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14407 states. [2019-12-26 21:12:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14407 states to 14407 states and 42784 transitions. [2019-12-26 21:12:01,577 INFO L78 Accepts]: Start accepts. Automaton has 14407 states and 42784 transitions. Word has length 67 [2019-12-26 21:12:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:01,577 INFO L462 AbstractCegarLoop]: Abstraction has 14407 states and 42784 transitions. [2019-12-26 21:12:01,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 14407 states and 42784 transitions. [2019-12-26 21:12:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:01,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:01,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:01,592 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:12:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:01,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1475658587, now seen corresponding path program 3 times [2019-12-26 21:12:01,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:01,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817180399] [2019-12-26 21:12:01,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:12:01,752 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:12:01,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817180399] [2019-12-26 21:12:01,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:12:01,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:12:01,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419900191] [2019-12-26 21:12:01,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:12:01,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:12:01,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:12:01,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:12:01,754 INFO L87 Difference]: Start difference. First operand 14407 states and 42784 transitions. Second operand 11 states. [2019-12-26 21:12:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:12:02,954 INFO L93 Difference]: Finished difference Result 25540 states and 75375 transitions. [2019-12-26 21:12:02,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:12:02,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-26 21:12:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:12:03,002 INFO L225 Difference]: With dead ends: 25540 [2019-12-26 21:12:03,002 INFO L226 Difference]: Without dead ends: 25325 [2019-12-26 21:12:03,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:12:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25325 states. [2019-12-26 21:12:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25325 to 14231. [2019-12-26 21:12:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14231 states. [2019-12-26 21:12:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14231 states to 14231 states and 42300 transitions. [2019-12-26 21:12:03,311 INFO L78 Accepts]: Start accepts. Automaton has 14231 states and 42300 transitions. Word has length 67 [2019-12-26 21:12:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:12:03,311 INFO L462 AbstractCegarLoop]: Abstraction has 14231 states and 42300 transitions. [2019-12-26 21:12:03,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:12:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 14231 states and 42300 transitions. [2019-12-26 21:12:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:12:03,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:12:03,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:12:03,329 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:12:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:12:03,329 INFO L82 PathProgramCache]: Analyzing trace with hash -200373485, now seen corresponding path program 4 times [2019-12-26 21:12:03,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:12:03,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370674186] [2019-12-26 21:12:03,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:12:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:12:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:12:03,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:12:03,497 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:12:03,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t56~0.offset_18|) (= v_~__unbuffered_cnt~0_134 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t56~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t56~0.base_23|) |v_ULTIMATE.start_main_~#t56~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a$r_buff1_thd0~0_110 0) (= v_~x~0_44 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd1~0_147) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t56~0.base_23| 1)) (= 0 v_~__unbuffered_p0_EAX~0_60) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t56~0.base_23| 4) |v_#length_23|) (= 0 v_~a$w_buff0_used~0_862) (= v_~__unbuffered_p0_EBX~0_60 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t56~0.base_23|) (= 0 v_~a$r_buff1_thd1~0_105) (= v_~main$tmp_guard1~0_27 0) (= v_~a$flush_delayed~0_24 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~a~0_173 0) (= v_~a$r_buff1_thd3~0_219 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~a$r_buff0_thd3~0_314 0) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~a$r_buff1_thd2~0_106) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$w_buff0~0_390 0) (= 0 v_~a$r_buff0_thd2~0_104) (= v_~y~0_53 0) (= v_~a$mem_tmp~0_13 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_22 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t56~0.base_23|)) (= v_~z~0_20 0) (= 0 v_~a$w_buff1~0_260) (= v_~weak$$choice2~0_108 0) (= v_~a$r_buff0_thd0~0_142 0) (= 0 v_~a$w_buff1_used~0_471) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_83|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_241|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_142, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_~#t58~0.offset=|v_ULTIMATE.start_main_~#t58~0.offset_15|, ~a~0=v_~a~0_173, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ULTIMATE.start_main_~#t57~0.offset=|v_ULTIMATE.start_main_~#t57~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_219, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_862, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_147, ULTIMATE.start_main_~#t58~0.base=|v_ULTIMATE.start_main_~#t58~0.base_20|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t56~0.offset=|v_ULTIMATE.start_main_~#t56~0.offset_18|, ~a$w_buff0~0=v_~a$w_buff0~0_390, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, ~x~0=v_~x~0_44, ULTIMATE.start_main_~#t57~0.base=|v_ULTIMATE.start_main_~#t57~0.base_23|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_61|, ~a$mem_tmp~0=v_~a$mem_tmp~0_13, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~a$w_buff1~0=v_~a$w_buff1~0_260, ~y~0=v_~y~0_53, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_105, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_314, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_24, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_471, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t56~0.base=|v_ULTIMATE.start_main_~#t56~0.base_23|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t58~0.offset, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t57~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t58~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t56~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t57~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t56~0.base] because there is no mapped edge [2019-12-26 21:12:03,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] P0ENTRY-->L4-3: Formula: (and (= P0Thread1of1ForFork2_~arg.offset_Out-229369527 |P0Thread1of1ForFork2_#in~arg.offset_In-229369527|) (= 0 (mod ~a$w_buff1_used~0_Out-229369527 256)) (= |P0Thread1of1ForFork2_#in~arg.base_In-229369527| P0Thread1of1ForFork2_~arg.base_Out-229369527) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-229369527 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-229369527|) (= ~a$w_buff1~0_Out-229369527 ~a$w_buff0~0_In-229369527) (= 1 ~a$w_buff0_used~0_Out-229369527) (= ~a$w_buff1_used~0_Out-229369527 ~a$w_buff0_used~0_In-229369527) (= ~a$w_buff0~0_Out-229369527 1) (= 1 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-229369527|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-229369527|, ~a$w_buff0~0=~a$w_buff0~0_In-229369527, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-229369527, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-229369527|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out-229369527, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-229369527|, ~a$w_buff0~0=~a$w_buff0~0_Out-229369527, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out-229369527, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-229369527, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-229369527, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-229369527|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-229369527, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out-229369527, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-229369527|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:12:03,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t57~0.base_13| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t57~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t57~0.base_13|) |v_ULTIMATE.start_main_~#t57~0.offset_11| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t57~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t57~0.offset_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t57~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t57~0.base_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t57~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t57~0.offset=|v_ULTIMATE.start_main_~#t57~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t57~0.base=|v_ULTIMATE.start_main_~#t57~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t57~0.offset, ULTIMATE.start_main_~#t57~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 21:12:03,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite10_Out979807111| |P1Thread1of1ForFork0_#t~ite9_Out979807111|)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In979807111 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In979807111 256)))) (or (and .cse0 (= ~a~0_In979807111 |P1Thread1of1ForFork0_#t~ite9_Out979807111|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out979807111| ~a$w_buff1~0_In979807111) (not .cse2)))) InVars {~a~0=~a~0_In979807111, ~a$w_buff1~0=~a$w_buff1~0_In979807111, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In979807111, ~a$w_buff1_used~0=~a$w_buff1_used~0_In979807111} OutVars{~a~0=~a~0_In979807111, ~a$w_buff1~0=~a$w_buff1~0_In979807111, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out979807111|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In979807111, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out979807111|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In979807111} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-26 21:12:03,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-970462600 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-970462600 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out-970462600| ~a$w_buff0_used~0_In-970462600)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-970462600|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-970462600, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-970462600} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-970462600, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-970462600|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-970462600} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-26 21:12:03,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-2035284881 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-2035284881 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-2035284881 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2035284881 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite12_Out-2035284881| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite12_Out-2035284881| ~a$w_buff1_used~0_In-2035284881) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2035284881, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2035284881, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2035284881, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2035284881} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2035284881, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2035284881, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-2035284881|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2035284881, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2035284881} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 21:12:03,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1435249547 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1435249547 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In-1435249547 |P1Thread1of1ForFork0_#t~ite13_Out-1435249547|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out-1435249547|) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1435249547, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1435249547} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1435249547, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1435249547, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-1435249547|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-26 21:12:03,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1881275904 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1881275904 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1881275904 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1881275904 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out-1881275904| ~a$r_buff1_thd2~0_In-1881275904) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite14_Out-1881275904| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1881275904, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1881275904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1881275904, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1881275904} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1881275904, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1881275904, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1881275904, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-1881275904|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1881275904} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 21:12:03,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= v_~a$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork0_#t~ite14_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_28|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_53, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_27|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 21:12:03,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t58~0.base_12| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t58~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t58~0.base_12|) |v_ULTIMATE.start_main_~#t58~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t58~0.base_12|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t58~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t58~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t58~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t58~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t58~0.offset=|v_ULTIMATE.start_main_~#t58~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t58~0.base=|v_ULTIMATE.start_main_~#t58~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t58~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t58~0.base] because there is no mapped edge [2019-12-26 21:12:03,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1939656142 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite21_Out1939656142| ~a$w_buff0~0_In1939656142) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In1939656142| |P2Thread1of1ForFork1_#t~ite20_Out1939656142|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1939656142 256)))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1939656142 256))) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1939656142 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In1939656142 256)))) (= |P2Thread1of1ForFork1_#t~ite20_Out1939656142| |P2Thread1of1ForFork1_#t~ite21_Out1939656142|) .cse0 (= |P2Thread1of1ForFork1_#t~ite20_Out1939656142| ~a$w_buff0~0_In1939656142)))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In1939656142|, ~a$w_buff0~0=~a$w_buff0~0_In1939656142, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1939656142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1939656142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1939656142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1939656142, ~weak$$choice2~0=~weak$$choice2~0_In1939656142} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out1939656142|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out1939656142|, ~a$w_buff0~0=~a$w_buff0~0_In1939656142, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1939656142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1939656142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1939656142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1939656142, ~weak$$choice2~0=~weak$$choice2~0_In1939656142} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 21:12:03,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In318039473 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_In318039473| |P2Thread1of1ForFork1_#t~ite26_Out318039473|) (not .cse0) (= ~a$w_buff0_used~0_In318039473 |P2Thread1of1ForFork1_#t~ite27_Out318039473|)) (and (= ~a$w_buff0_used~0_In318039473 |P2Thread1of1ForFork1_#t~ite26_Out318039473|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In318039473 256)))) (or (and (= (mod ~a$r_buff1_thd3~0_In318039473 256) 0) .cse1) (and (= 0 (mod ~a$w_buff1_used~0_In318039473 256)) .cse1) (= (mod ~a$w_buff0_used~0_In318039473 256) 0))) .cse0 (= |P2Thread1of1ForFork1_#t~ite27_Out318039473| |P2Thread1of1ForFork1_#t~ite26_Out318039473|)))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In318039473|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In318039473, ~a$w_buff0_used~0=~a$w_buff0_used~0_In318039473, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In318039473, ~a$w_buff1_used~0=~a$w_buff1_used~0_In318039473, ~weak$$choice2~0=~weak$$choice2~0_In318039473} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out318039473|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out318039473|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In318039473, ~a$w_buff0_used~0=~a$w_buff0_used~0_In318039473, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In318039473, ~a$w_buff1_used~0=~a$w_buff1_used~0_In318039473, ~weak$$choice2~0=~weak$$choice2~0_In318039473} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-26 21:12:03,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 21:12:03,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_42 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_42, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 21:12:03,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-825834920 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-825834920 256)))) (or (and (= ~a$w_buff1~0_In-825834920 |P2Thread1of1ForFork1_#t~ite38_Out-825834920|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out-825834920| ~a~0_In-825834920)))) InVars {~a~0=~a~0_In-825834920, ~a$w_buff1~0=~a$w_buff1~0_In-825834920, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-825834920, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-825834920} OutVars{~a~0=~a~0_In-825834920, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-825834920|, ~a$w_buff1~0=~a$w_buff1~0_In-825834920, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-825834920, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-825834920} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-26 21:12:03,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_31 |v_P2Thread1of1ForFork1_#t~ite38_14|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_14|} OutVars{~a~0=v_~a~0_31, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_13|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_13|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-26 21:12:03,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1345398142 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1345398142 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite40_Out-1345398142| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1345398142 |P2Thread1of1ForFork1_#t~ite40_Out-1345398142|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345398142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1345398142} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345398142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1345398142, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1345398142|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-26 21:12:03,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1118064498 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-1118064498 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1118064498 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1118064498 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1118064498 |P2Thread1of1ForFork1_#t~ite41_Out-1118064498|)) (and (= |P2Thread1of1ForFork1_#t~ite41_Out-1118064498| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1118064498, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1118064498, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1118064498, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1118064498} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1118064498, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1118064498, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1118064498, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-1118064498|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1118064498} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-26 21:12:03,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1459573853 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1459573853 256)))) (or (and (= ~a$r_buff0_thd3~0_In-1459573853 |P2Thread1of1ForFork1_#t~ite42_Out-1459573853|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1459573853|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1459573853, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1459573853} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1459573853|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1459573853, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1459573853} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-26 21:12:03,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-221997283 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-221997283 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-221997283 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-221997283 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out-221997283| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In-221997283 |P2Thread1of1ForFork1_#t~ite43_Out-221997283|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-221997283, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-221997283, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-221997283, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-221997283} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-221997283|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-221997283, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-221997283, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-221997283, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-221997283} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-26 21:12:03,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~a$r_buff1_thd3~0_109 |v_P2Thread1of1ForFork1_#t~ite43_34|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_109, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 21:12:03,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1795510086 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1795510086 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1795510086 |P0Thread1of1ForFork2_#t~ite5_Out-1795510086|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-1795510086|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1795510086, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1795510086} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-1795510086|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1795510086, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1795510086} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 21:12:03,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-1058675588 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1058675588 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1058675588 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-1058675588 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-1058675588 |P0Thread1of1ForFork2_#t~ite6_Out-1058675588|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-1058675588|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1058675588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1058675588, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1058675588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1058675588} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1058675588, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1058675588|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1058675588, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1058675588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1058675588} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 21:12:03,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-29709988 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-29709988 256) 0))) (or (and (= ~a$r_buff0_thd1~0_Out-29709988 ~a$r_buff0_thd1~0_In-29709988) (or .cse0 .cse1)) (and (not .cse1) (= ~a$r_buff0_thd1~0_Out-29709988 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-29709988, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-29709988} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-29709988|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-29709988, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-29709988} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:12:03,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd1~0_In-436371462 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-436371462 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-436371462 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-436371462 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out-436371462| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork2_#t~ite8_Out-436371462| ~a$r_buff1_thd1~0_In-436371462) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-436371462, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-436371462, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-436371462, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-436371462} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-436371462|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-436371462, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-436371462, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-436371462, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-436371462} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 21:12:03,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_44| v_~a$r_buff1_thd1~0_72) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_43|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:12:03,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:12:03,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-2115243638 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-2115243638 256) 0))) (or (and (not .cse0) (= ~a$w_buff1~0_In-2115243638 |ULTIMATE.start_main_#t~ite47_Out-2115243638|) (not .cse1)) (and (or .cse0 .cse1) (= ~a~0_In-2115243638 |ULTIMATE.start_main_#t~ite47_Out-2115243638|)))) InVars {~a~0=~a~0_In-2115243638, ~a$w_buff1~0=~a$w_buff1~0_In-2115243638, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2115243638, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2115243638} OutVars{~a~0=~a~0_In-2115243638, ~a$w_buff1~0=~a$w_buff1~0_In-2115243638, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2115243638|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2115243638, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2115243638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:12:03,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_58 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:12:03,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In187955541 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In187955541 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In187955541 |ULTIMATE.start_main_#t~ite49_Out187955541|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out187955541|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In187955541, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In187955541} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In187955541, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out187955541|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In187955541} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:12:03,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-427496059 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-427496059 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-427496059 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-427496059 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-427496059|)) (and (= ~a$w_buff1_used~0_In-427496059 |ULTIMATE.start_main_#t~ite50_Out-427496059|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-427496059, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-427496059, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-427496059, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-427496059} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-427496059|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-427496059, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-427496059, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-427496059, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-427496059} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:12:03,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1815157908 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1815157908 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1815157908| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In1815157908 |ULTIMATE.start_main_#t~ite51_Out1815157908|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1815157908, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1815157908} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1815157908|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1815157908, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1815157908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:12:03,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1413440719 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1413440719 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-1413440719 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-1413440719 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1413440719|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In-1413440719 |ULTIMATE.start_main_#t~ite52_Out-1413440719|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1413440719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1413440719, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1413440719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1413440719} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1413440719|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1413440719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1413440719, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1413440719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1413440719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:12:03,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_21 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_21 256)) (= 1 v_~__unbuffered_p1_EAX~0_27) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~a$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite52_44|) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p0_EAX~0_54) (= 1 v_~__unbuffered_p2_EAX~0_24)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_44|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_104, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:12:03,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:12:03 BasicIcfg [2019-12-26 21:12:03,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:12:03,684 INFO L168 Benchmark]: Toolchain (without parser) took 95725.04 ms. Allocated memory was 138.4 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 102.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-26 21:12:03,685 INFO L168 Benchmark]: CDTParser took 1.34 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 21:12:03,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.06 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.5 MB in the beginning and 156.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:03,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.81 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:03,687 INFO L168 Benchmark]: Boogie Preprocessor took 47.38 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:03,687 INFO L168 Benchmark]: RCFGBuilder took 853.16 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 100.3 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:12:03,693 INFO L168 Benchmark]: TraceAbstraction took 94035.87 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-26 21:12:03,702 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.34 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 718.06 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.5 MB in the beginning and 156.3 MB in the end (delta: -54.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.81 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.38 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 853.16 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 100.3 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 94035.87 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 180 ProgramPointsBefore, 95 ProgramPointsAfterwards, 217 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7415 VarBasedMoverChecksPositive, 242 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 273 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 93316 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t56, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t57, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t58, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 93.6s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6948 SDtfs, 10100 SDslu, 23759 SDs, 0 SdLazy, 8892 SolverSat, 454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162301occurred 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: 35.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 349867 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1351 NumberOfCodeBlocks, 1351 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1257 ConstructedInterpolants, 0 QuantifiedInterpolants, 245388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...