/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:23:54,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:23:54,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:23:54,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:23:54,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:23:54,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:23:54,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:23:54,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:23:54,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:23:54,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:23:54,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:23:54,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:23:54,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:23:54,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:23:54,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:23:54,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:23:54,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:23:54,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:23:54,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:23:54,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:23:54,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:23:54,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:23:54,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:23:54,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:23:54,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:23:54,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:23:54,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:23:54,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:23:54,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:23:54,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:23:54,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:23:54,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:23:54,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:23:54,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:23:54,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:23:54,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:23:54,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:23:54,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:23:54,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:23:54,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:23:54,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:23:54,824 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:23:54,844 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:23:54,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:23:54,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:23:54,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:23:54,846 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:23:54,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:23:54,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:23:54,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:23:54,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:23:54,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:23:54,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:23:54,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:23:54,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:23:54,848 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:23:54,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:23:54,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:23:54,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:23:54,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:23:54,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:23:54,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:23:54,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:23:54,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:23:54,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:23:54,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:23:54,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:23:54,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:23:54,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:23:54,850 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:23:54,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:23:54,851 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:23:54,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:23:55,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:23:55,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:23:55,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:23:55,156 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:23:55,157 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:23:55,159 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.oepc.i [2019-12-27 16:23:55,227 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a4eef0a/e10834943bae4f96bdc6a52fc804d66c/FLAG937174829 [2019-12-27 16:23:55,819 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:23:55,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_tso.oepc.i [2019-12-27 16:23:55,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a4eef0a/e10834943bae4f96bdc6a52fc804d66c/FLAG937174829 [2019-12-27 16:23:56,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a4eef0a/e10834943bae4f96bdc6a52fc804d66c [2019-12-27 16:23:56,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:23:56,085 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:23:56,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:23:56,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:23:56,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:23:56,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:23:56" (1/1) ... [2019-12-27 16:23:56,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56, skipping insertion in model container [2019-12-27 16:23:56,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:23:56" (1/1) ... [2019-12-27 16:23:56,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:23:56,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:23:56,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:23:56,707 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:23:56,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:23:56,857 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:23:56,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56 WrapperNode [2019-12-27 16:23:56,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:23:56,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:23:56,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:23:56,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:23:56,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56" (1/1) ... [2019-12-27 16:23:56,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56" (1/1) ... [2019-12-27 16:23:56,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:23:56,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:23:56,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:23:56,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:23:56,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56" (1/1) ... [2019-12-27 16:23:56,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56" (1/1) ... [2019-12-27 16:23:56,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56" (1/1) ... [2019-12-27 16:23:56,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56" (1/1) ... [2019-12-27 16:23:56,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56" (1/1) ... [2019-12-27 16:23:56,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56" (1/1) ... [2019-12-27 16:23:56,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56" (1/1) ... [2019-12-27 16:23:56,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:23:56,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:23:56,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:23:56,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:23:56,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56" (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-27 16:23:57,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:23:57,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:23:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:23:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:23:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:23:57,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:23:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:23:57,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:23:57,038 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:23:57,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:23:57,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:23:57,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:23:57,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:23:57,041 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:23:57,815 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:23:57,816 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:23:57,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:23:57 BoogieIcfgContainer [2019-12-27 16:23:57,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:23:57,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:23:57,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:23:57,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:23:57,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:23:56" (1/3) ... [2019-12-27 16:23:57,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177297b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:23:57, skipping insertion in model container [2019-12-27 16:23:57,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:23:56" (2/3) ... [2019-12-27 16:23:57,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177297b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:23:57, skipping insertion in model container [2019-12-27 16:23:57,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:23:57" (3/3) ... [2019-12-27 16:23:57,826 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_tso.oepc.i [2019-12-27 16:23:57,837 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:23:57,837 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:23:57,845 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:23:57,846 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:23:57,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,892 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,892 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,907 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,908 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,925 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,942 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,984 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,986 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,993 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,993 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:57,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:58,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:58,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:23:58,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:23:58,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:23:58,037 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:23:58,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:23:58,037 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:23:58,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:23:58,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:23:58,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:23:58,037 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:23:58,052 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 16:23:58,054 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 16:23:58,171 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 16:23:58,171 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:23:58,188 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:23:58,211 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 16:23:58,276 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 16:23:58,277 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:23:58,288 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:23:58,314 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:23:58,315 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:24:03,513 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-27 16:24:03,955 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 16:24:04,101 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:24:04,127 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-27 16:24:04,127 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 16:24:04,130 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 16:24:24,003 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-27 16:24:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-27 16:24:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:24:24,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:24,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:24:24,011 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-27 16:24:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:24,016 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-27 16:24:24,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:24,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678019869] [2019-12-27 16:24:24,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:24,290 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-27 16:24:24,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678019869] [2019-12-27 16:24:24,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:24,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:24:24,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [997810433] [2019-12-27 16:24:24,294 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:24,298 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:24,310 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:24:24,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:24,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:24:24,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:24:24,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:24,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:24:24,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:24,333 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-27 16:24:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:27,657 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-27 16:24:27,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:24:27,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:24:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:28,413 INFO L225 Difference]: With dead ends: 114110 [2019-12-27 16:24:28,414 INFO L226 Difference]: Without dead ends: 107012 [2019-12-27 16:24:28,416 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-27 16:24:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-27 16:24:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-27 16:24:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-27 16:24:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-27 16:24:39,283 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-27 16:24:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:24:39,283 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-27 16:24:39,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:24:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-27 16:24:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:24:39,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:39,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:24:39,288 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-27 16:24:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-27 16:24:39,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:39,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284751194] [2019-12-27 16:24:39,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:39,410 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-27 16:24:39,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284751194] [2019-12-27 16:24:39,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:39,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:24:39,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [324635008] [2019-12-27 16:24:39,412 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:39,414 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:39,418 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:24:39,418 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:39,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:24:39,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:24:39,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:39,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:24:39,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:24:39,422 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-27 16:24:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:45,338 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-27 16:24:45,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:24:45,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:24:45,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:45,958 INFO L225 Difference]: With dead ends: 166210 [2019-12-27 16:24:45,958 INFO L226 Difference]: Without dead ends: 166161 [2019-12-27 16:24:45,959 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-27 16:24:51,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-27 16:24:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-27 16:24:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-27 16:25:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-27 16:25:00,616 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-27 16:25:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:00,616 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-27 16:25:00,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:25:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-27 16:25:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:25:00,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:00,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:00,624 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-27 16:25:00,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:00,624 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-27 16:25:00,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:00,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990265307] [2019-12-27 16:25:00,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:00,699 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-27 16:25:00,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990265307] [2019-12-27 16:25:00,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:00,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:25:00,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [40462750] [2019-12-27 16:25:00,701 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:00,702 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:00,704 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:25:00,704 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:00,704 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:00,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:25:00,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:00,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:25:00,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:00,705 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-27 16:25:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:00,847 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-27 16:25:00,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:25:00,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:25:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:00,899 INFO L225 Difference]: With dead ends: 33068 [2019-12-27 16:25:00,900 INFO L226 Difference]: Without dead ends: 33068 [2019-12-27 16:25:00,900 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-27 16:25:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-27 16:25:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-27 16:25:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-27 16:25:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-27 16:25:01,462 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-27 16:25:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:01,463 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-27 16:25:01,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-27 16:25:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:25:01,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:01,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:01,466 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-27 16:25:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:01,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-27 16:25:01,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:01,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744519609] [2019-12-27 16:25:01,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:01,550 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-27 16:25:01,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744519609] [2019-12-27 16:25:01,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:01,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:25:01,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1650023101] [2019-12-27 16:25:01,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:01,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:01,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:25:01,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:01,557 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:01,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:25:01,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:01,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:25:01,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:01,558 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-27 16:25:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:02,142 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-27 16:25:02,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:25:02,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:25:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:02,241 INFO L225 Difference]: With dead ends: 45410 [2019-12-27 16:25:02,242 INFO L226 Difference]: Without dead ends: 45410 [2019-12-27 16:25:02,242 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-27 16:25:02,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-27 16:25:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-27 16:25:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-27 16:25:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-27 16:25:04,283 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-27 16:25:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:04,284 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-27 16:25:04,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:25:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-27 16:25:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:25:04,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:04,294 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-27 16:25:04,294 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-27 16:25:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-27 16:25:04,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:04,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968675184] [2019-12-27 16:25:04,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:04,406 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-27 16:25:04,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968675184] [2019-12-27 16:25:04,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:04,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:25:04,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2014747128] [2019-12-27 16:25:04,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:04,411 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:04,418 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:25:04,418 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:04,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:25:04,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:25:04,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:04,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:25:04,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:25:04,473 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 7 states. [2019-12-27 16:25:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:05,713 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-27 16:25:05,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:25:05,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 16:25:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:05,826 INFO L225 Difference]: With dead ends: 56872 [2019-12-27 16:25:05,826 INFO L226 Difference]: Without dead ends: 56865 [2019-12-27 16:25:05,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:25:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-27 16:25:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-27 16:25:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-27 16:25:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-27 16:25:07,607 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-27 16:25:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:07,607 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-27 16:25:07,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:25:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-27 16:25:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:25:07,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:07,621 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-27 16:25:07,621 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-27 16:25:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-27 16:25:07,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:07,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892615395] [2019-12-27 16:25:07,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:07,694 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-27 16:25:07,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892615395] [2019-12-27 16:25:07,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:07,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:25:07,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [837063742] [2019-12-27 16:25:07,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:07,702 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:07,712 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:25:07,712 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:07,728 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:25:07,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:25:07,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:07,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:25:07,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:07,730 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 5 states. [2019-12-27 16:25:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:07,800 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-27 16:25:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:25:07,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:25:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:07,823 INFO L225 Difference]: With dead ends: 16014 [2019-12-27 16:25:07,823 INFO L226 Difference]: Without dead ends: 16014 [2019-12-27 16:25:07,824 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-27 16:25:07,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-27 16:25:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-27 16:25:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-27 16:25:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-27 16:25:08,058 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-27 16:25:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:08,059 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-27 16:25:08,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:25:08,059 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-27 16:25:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:25:08,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:08,070 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-27 16:25:08,070 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-27 16:25:08,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:08,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-27 16:25:08,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:08,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066534732] [2019-12-27 16:25:08,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:08,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066534732] [2019-12-27 16:25:08,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:08,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:25:08,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072471251] [2019-12-27 16:25:08,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:08,160 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:08,166 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:25:08,167 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:08,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:08,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:25:08,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:08,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:25:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:25:08,168 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-27 16:25:08,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:08,778 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-27 16:25:08,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:25:08,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:25:08,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:08,820 INFO L225 Difference]: With dead ends: 22624 [2019-12-27 16:25:08,820 INFO L226 Difference]: Without dead ends: 22624 [2019-12-27 16:25:08,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:25:08,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-27 16:25:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-27 16:25:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-27 16:25:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-27 16:25:09,186 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-27 16:25:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:09,186 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-27 16:25:09,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:25:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-27 16:25:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:25:09,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:09,206 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-27 16:25:09,206 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-27 16:25:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:09,207 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-27 16:25:09,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:09,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120596832] [2019-12-27 16:25:09,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:09,306 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-27 16:25:09,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120596832] [2019-12-27 16:25:09,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:09,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:25:09,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1845782981] [2019-12-27 16:25:09,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:09,313 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:09,326 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:25:09,326 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:09,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:25:09,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:25:09,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:09,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:25:09,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:25:09,346 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 8 states. [2019-12-27 16:25:10,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:10,661 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-27 16:25:10,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:25:10,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 16:25:10,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:10,693 INFO L225 Difference]: With dead ends: 24689 [2019-12-27 16:25:10,694 INFO L226 Difference]: Without dead ends: 24689 [2019-12-27 16:25:10,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:25:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-27 16:25:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-27 16:25:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-27 16:25:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-27 16:25:11,664 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-27 16:25:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:11,664 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-27 16:25:11,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:25:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-27 16:25:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:25:11,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:11,686 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-27 16:25:11,687 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-27 16:25:11,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-27 16:25:11,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:11,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396752538] [2019-12-27 16:25:11,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:11,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396752538] [2019-12-27 16:25:11,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:11,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:25:11,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [731958442] [2019-12-27 16:25:11,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:11,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:11,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 211 transitions. [2019-12-27 16:25:11,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:11,815 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:11,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:25:11,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:11,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:25:11,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:11,817 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-27 16:25:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:11,951 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-27 16:25:11,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:25:11,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:25:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:11,977 INFO L225 Difference]: With dead ends: 31245 [2019-12-27 16:25:11,977 INFO L226 Difference]: Without dead ends: 17019 [2019-12-27 16:25:11,977 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-27 16:25:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-27 16:25:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-27 16:25:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 16:25:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-27 16:25:12,218 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-27 16:25:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:12,218 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-27 16:25:12,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-27 16:25:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:25:12,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:12,241 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-27 16:25:12,241 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-27 16:25:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-27 16:25:12,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:12,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480099030] [2019-12-27 16:25:12,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:12,302 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-27 16:25:12,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480099030] [2019-12-27 16:25:12,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:12,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:25:12,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [321043819] [2019-12-27 16:25:12,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:12,311 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:12,349 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 164 transitions. [2019-12-27 16:25:12,349 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:12,368 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:25:12,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:25:12,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:12,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:25:12,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:12,369 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 5 states. [2019-12-27 16:25:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:12,494 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-27 16:25:12,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:25:12,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 16:25:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:12,514 INFO L225 Difference]: With dead ends: 24032 [2019-12-27 16:25:12,514 INFO L226 Difference]: Without dead ends: 10093 [2019-12-27 16:25:12,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:25:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-27 16:25:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-27 16:25:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-27 16:25:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-27 16:25:12,678 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-27 16:25:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:12,679 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-27 16:25:12,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:25:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-27 16:25:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:25:12,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:12,692 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-27 16:25:12,692 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-27 16:25:12,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-27 16:25:12,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:12,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374577477] [2019-12-27 16:25:12,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:12,773 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-27 16:25:12,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374577477] [2019-12-27 16:25:12,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:12,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:25:12,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1850451312] [2019-12-27 16:25:12,774 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:12,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:12,857 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 16:25:12,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:12,907 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 16:25:12,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:25:12,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:12,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:25:12,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:25:12,909 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 7 states. [2019-12-27 16:25:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:12,971 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-27 16:25:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:25:12,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:25:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:12,983 INFO L225 Difference]: With dead ends: 9224 [2019-12-27 16:25:12,983 INFO L226 Difference]: Without dead ends: 6480 [2019-12-27 16:25:12,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:25:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-27 16:25:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-27 16:25:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-27 16:25:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-27 16:25:13,091 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-27 16:25:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:13,092 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-27 16:25:13,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:25:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-27 16:25:13,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:13,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:13,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:13,100 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-27 16:25:13,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:13,100 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-27 16:25:13,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:13,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489164470] [2019-12-27 16:25:13,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:13,159 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-27 16:25:13,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489164470] [2019-12-27 16:25:13,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:13,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:25:13,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [961796608] [2019-12-27 16:25:13,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:13,182 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:14,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 464 transitions. [2019-12-27 16:25:14,012 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:14,032 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:25:14,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:25:14,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:14,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:25:14,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:14,033 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-27 16:25:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:14,097 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-27 16:25:14,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:25:14,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:25:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:14,111 INFO L225 Difference]: With dead ends: 9612 [2019-12-27 16:25:14,111 INFO L226 Difference]: Without dead ends: 9612 [2019-12-27 16:25:14,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-27 16:25:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-27 16:25:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-27 16:25:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-27 16:25:14,249 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-27 16:25:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:14,249 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-27 16:25:14,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-27 16:25:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:14,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:14,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:14,258 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-27 16:25:14,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-27 16:25:14,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:14,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022938237] [2019-12-27 16:25:14,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:14,342 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-27 16:25:14,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022938237] [2019-12-27 16:25:14,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:14,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:25:14,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1158691697] [2019-12-27 16:25:14,343 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:14,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:14,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 310 states and 635 transitions. [2019-12-27 16:25:14,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:14,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 16:25:14,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:25:14,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:14,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:25:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:25:14,924 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 13 states. [2019-12-27 16:25:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:16,750 INFO L93 Difference]: Finished difference Result 22388 states and 69098 transitions. [2019-12-27 16:25:16,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:25:16,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:25:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:16,775 INFO L225 Difference]: With dead ends: 22388 [2019-12-27 16:25:16,775 INFO L226 Difference]: Without dead ends: 16774 [2019-12-27 16:25:16,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:25:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16774 states. [2019-12-27 16:25:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16774 to 9096. [2019-12-27 16:25:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-27 16:25:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-27 16:25:17,541 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-27 16:25:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:17,542 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-27 16:25:17,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:25:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-27 16:25:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:17,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:17,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:17,552 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-27 16:25:17,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:17,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-27 16:25:17,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:17,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61976878] [2019-12-27 16:25:17,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:17,634 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-27 16:25:17,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61976878] [2019-12-27 16:25:17,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:17,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:25:17,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1490528977] [2019-12-27 16:25:17,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:17,656 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:17,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 348 states and 697 transitions. [2019-12-27 16:25:17,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:18,193 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 16:25:18,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:25:18,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:18,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:25:18,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:25:18,195 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 13 states. [2019-12-27 16:25:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:18,751 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-27 16:25:18,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:25:18,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:25:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:18,770 INFO L225 Difference]: With dead ends: 16709 [2019-12-27 16:25:18,770 INFO L226 Difference]: Without dead ends: 12623 [2019-12-27 16:25:18,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:25:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-27 16:25:18,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-27 16:25:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-27 16:25:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-27 16:25:18,948 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-27 16:25:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:18,948 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-27 16:25:18,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:25:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-27 16:25:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:18,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:18,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:18,959 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-27 16:25:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-27 16:25:18,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:18,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735937668] [2019-12-27 16:25:18,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:19,081 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-27 16:25:19,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735937668] [2019-12-27 16:25:19,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:19,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:25:19,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033816779] [2019-12-27 16:25:19,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:19,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:19,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 332 states and 662 transitions. [2019-12-27 16:25:19,936 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:20,242 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 16:25:20,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:25:20,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:20,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:25:20,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:25:20,243 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 13 states. [2019-12-27 16:25:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:23,057 INFO L93 Difference]: Finished difference Result 51743 states and 159088 transitions. [2019-12-27 16:25:23,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 16:25:23,057 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:25:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:23,113 INFO L225 Difference]: With dead ends: 51743 [2019-12-27 16:25:23,114 INFO L226 Difference]: Without dead ends: 38901 [2019-12-27 16:25:23,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 26 SyntacticMatches, 17 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=771, Invalid=2535, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 16:25:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38901 states. [2019-12-27 16:25:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38901 to 12885. [2019-12-27 16:25:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2019-12-27 16:25:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 40786 transitions. [2019-12-27 16:25:24,155 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 40786 transitions. Word has length 64 [2019-12-27 16:25:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:24,155 INFO L462 AbstractCegarLoop]: Abstraction has 12885 states and 40786 transitions. [2019-12-27 16:25:24,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:25:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 40786 transitions. [2019-12-27 16:25:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:24,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:24,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:24,177 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-27 16:25:24,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:24,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 4 times [2019-12-27 16:25:24,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:24,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692321939] [2019-12-27 16:25:24,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:24,263 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-27 16:25:24,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692321939] [2019-12-27 16:25:24,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:24,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:25:24,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1410163780] [2019-12-27 16:25:24,264 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:24,283 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:24,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 322 states and 631 transitions. [2019-12-27 16:25:24,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:24,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:25:24,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:25:24,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:24,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:25:24,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:24,577 INFO L87 Difference]: Start difference. First operand 12885 states and 40786 transitions. Second operand 5 states. [2019-12-27 16:25:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:24,839 INFO L93 Difference]: Finished difference Result 14570 states and 45489 transitions. [2019-12-27 16:25:24,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:25:24,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 16:25:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:24,860 INFO L225 Difference]: With dead ends: 14570 [2019-12-27 16:25:24,860 INFO L226 Difference]: Without dead ends: 14570 [2019-12-27 16:25:24,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:25:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14570 states. [2019-12-27 16:25:25,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14570 to 13816. [2019-12-27 16:25:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13816 states. [2019-12-27 16:25:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13816 states to 13816 states and 43407 transitions. [2019-12-27 16:25:25,083 INFO L78 Accepts]: Start accepts. Automaton has 13816 states and 43407 transitions. Word has length 64 [2019-12-27 16:25:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:25,084 INFO L462 AbstractCegarLoop]: Abstraction has 13816 states and 43407 transitions. [2019-12-27 16:25:25,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:25:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 13816 states and 43407 transitions. [2019-12-27 16:25:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:25,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:25,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:25,105 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-27 16:25:25,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:25,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1714079827, now seen corresponding path program 5 times [2019-12-27 16:25:25,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:25,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654928168] [2019-12-27 16:25:25,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:25,229 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-27 16:25:25,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654928168] [2019-12-27 16:25:25,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:25,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:25:25,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210603823] [2019-12-27 16:25:25,231 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:25,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:26,206 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 484 transitions. [2019-12-27 16:25:26,206 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:26,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:25:26,399 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:25:26,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:25:26,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:26,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:25:26,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:25:26,400 INFO L87 Difference]: Start difference. First operand 13816 states and 43407 transitions. Second operand 10 states. [2019-12-27 16:25:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:28,007 INFO L93 Difference]: Finished difference Result 28514 states and 86570 transitions. [2019-12-27 16:25:28,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:25:28,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 16:25:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:28,047 INFO L225 Difference]: With dead ends: 28514 [2019-12-27 16:25:28,047 INFO L226 Difference]: Without dead ends: 28346 [2019-12-27 16:25:28,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:25:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28346 states. [2019-12-27 16:25:28,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28346 to 20759. [2019-12-27 16:25:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20759 states. [2019-12-27 16:25:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20759 states to 20759 states and 63630 transitions. [2019-12-27 16:25:28,426 INFO L78 Accepts]: Start accepts. Automaton has 20759 states and 63630 transitions. Word has length 64 [2019-12-27 16:25:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:28,426 INFO L462 AbstractCegarLoop]: Abstraction has 20759 states and 63630 transitions. [2019-12-27 16:25:28,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:25:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 20759 states and 63630 transitions. [2019-12-27 16:25:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:28,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:28,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:28,450 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-27 16:25:28,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:28,450 INFO L82 PathProgramCache]: Analyzing trace with hash 768567647, now seen corresponding path program 6 times [2019-12-27 16:25:28,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:28,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382433314] [2019-12-27 16:25:28,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:28,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382433314] [2019-12-27 16:25:28,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:28,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:25:28,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207159881] [2019-12-27 16:25:28,546 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:28,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:29,614 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 265 states and 464 transitions. [2019-12-27 16:25:29,615 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:29,867 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 16:25:29,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:25:29,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:29,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:25:29,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:25:29,868 INFO L87 Difference]: Start difference. First operand 20759 states and 63630 transitions. Second operand 13 states. [2019-12-27 16:25:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:33,842 INFO L93 Difference]: Finished difference Result 76185 states and 227873 transitions. [2019-12-27 16:25:33,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 16:25:33,843 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:25:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:33,956 INFO L225 Difference]: With dead ends: 76185 [2019-12-27 16:25:33,956 INFO L226 Difference]: Without dead ends: 75965 [2019-12-27 16:25:33,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=349, Invalid=983, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 16:25:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75965 states. [2019-12-27 16:25:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75965 to 30489. [2019-12-27 16:25:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30489 states. [2019-12-27 16:25:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30489 states to 30489 states and 93911 transitions. [2019-12-27 16:25:35,612 INFO L78 Accepts]: Start accepts. Automaton has 30489 states and 93911 transitions. Word has length 64 [2019-12-27 16:25:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:35,613 INFO L462 AbstractCegarLoop]: Abstraction has 30489 states and 93911 transitions. [2019-12-27 16:25:35,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:25:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 30489 states and 93911 transitions. [2019-12-27 16:25:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:35,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:35,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:35,649 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-27 16:25:35,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:35,649 INFO L82 PathProgramCache]: Analyzing trace with hash 908702963, now seen corresponding path program 7 times [2019-12-27 16:25:35,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:35,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591780773] [2019-12-27 16:25:35,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:35,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-27 16:25:35,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591780773] [2019-12-27 16:25:35,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:35,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:25:35,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128332722] [2019-12-27 16:25:35,753 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:35,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:36,039 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 446 transitions. [2019-12-27 16:25:36,039 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:36,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:25:36,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:25:36,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:25:36,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:36,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:25:36,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:25:36,149 INFO L87 Difference]: Start difference. First operand 30489 states and 93911 transitions. Second operand 9 states. [2019-12-27 16:25:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:38,463 INFO L93 Difference]: Finished difference Result 41066 states and 125203 transitions. [2019-12-27 16:25:38,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:25:38,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 16:25:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:38,519 INFO L225 Difference]: With dead ends: 41066 [2019-12-27 16:25:38,520 INFO L226 Difference]: Without dead ends: 41066 [2019-12-27 16:25:38,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:25:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41066 states. [2019-12-27 16:25:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41066 to 32847. [2019-12-27 16:25:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32847 states. [2019-12-27 16:25:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32847 states to 32847 states and 100622 transitions. [2019-12-27 16:25:39,054 INFO L78 Accepts]: Start accepts. Automaton has 32847 states and 100622 transitions. Word has length 64 [2019-12-27 16:25:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:39,054 INFO L462 AbstractCegarLoop]: Abstraction has 32847 states and 100622 transitions. [2019-12-27 16:25:39,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:25:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 32847 states and 100622 transitions. [2019-12-27 16:25:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:39,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:39,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:39,090 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-27 16:25:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1398237635, now seen corresponding path program 8 times [2019-12-27 16:25:39,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:39,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561828233] [2019-12-27 16:25:39,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:39,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561828233] [2019-12-27 16:25:39,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:39,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:25:39,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1140849121] [2019-12-27 16:25:39,192 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:39,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:39,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 429 transitions. [2019-12-27 16:25:39,471 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:39,647 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:25:39,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:25:39,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:39,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:25:39,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:25:39,648 INFO L87 Difference]: Start difference. First operand 32847 states and 100622 transitions. Second operand 13 states. [2019-12-27 16:25:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:43,109 INFO L93 Difference]: Finished difference Result 65892 states and 197590 transitions. [2019-12-27 16:25:43,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:25:43,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:25:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:43,208 INFO L225 Difference]: With dead ends: 65892 [2019-12-27 16:25:43,208 INFO L226 Difference]: Without dead ends: 65892 [2019-12-27 16:25:43,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:25:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65892 states. [2019-12-27 16:25:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65892 to 33317. [2019-12-27 16:25:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33317 states. [2019-12-27 16:25:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33317 states to 33317 states and 101998 transitions. [2019-12-27 16:25:44,107 INFO L78 Accepts]: Start accepts. Automaton has 33317 states and 101998 transitions. Word has length 64 [2019-12-27 16:25:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:44,108 INFO L462 AbstractCegarLoop]: Abstraction has 33317 states and 101998 transitions. [2019-12-27 16:25:44,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:25:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 33317 states and 101998 transitions. [2019-12-27 16:25:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:44,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:44,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:44,144 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-27 16:25:44,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash 130546237, now seen corresponding path program 9 times [2019-12-27 16:25:44,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:44,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296285275] [2019-12-27 16:25:44,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:44,239 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-27 16:25:44,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296285275] [2019-12-27 16:25:44,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:44,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:25:44,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [261031193] [2019-12-27 16:25:44,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:44,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:45,142 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 356 transitions. [2019-12-27 16:25:45,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:45,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:25:45,301 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 16:25:45,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:25:45,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:45,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:25:45,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:25:45,303 INFO L87 Difference]: Start difference. First operand 33317 states and 101998 transitions. Second operand 11 states. [2019-12-27 16:25:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:47,899 INFO L93 Difference]: Finished difference Result 87197 states and 263542 transitions. [2019-12-27 16:25:47,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:25:47,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 16:25:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:48,033 INFO L225 Difference]: With dead ends: 87197 [2019-12-27 16:25:48,033 INFO L226 Difference]: Without dead ends: 87197 [2019-12-27 16:25:48,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:25:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87197 states. [2019-12-27 16:25:49,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87197 to 36239. [2019-12-27 16:25:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36239 states. [2019-12-27 16:25:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36239 states to 36239 states and 110962 transitions. [2019-12-27 16:25:49,733 INFO L78 Accepts]: Start accepts. Automaton has 36239 states and 110962 transitions. Word has length 64 [2019-12-27 16:25:49,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:49,734 INFO L462 AbstractCegarLoop]: Abstraction has 36239 states and 110962 transitions. [2019-12-27 16:25:49,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:25:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 36239 states and 110962 transitions. [2019-12-27 16:25:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:49,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:49,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:49,782 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-27 16:25:49,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:49,783 INFO L82 PathProgramCache]: Analyzing trace with hash -789321411, now seen corresponding path program 10 times [2019-12-27 16:25:49,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:49,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983019985] [2019-12-27 16:25:49,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:49,886 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-27 16:25:49,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983019985] [2019-12-27 16:25:49,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:49,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:25:49,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381847068] [2019-12-27 16:25:49,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:49,907 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:50,158 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 404 transitions. [2019-12-27 16:25:50,159 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:50,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:25:50,334 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 16:25:50,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:25:50,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:50,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:25:50,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:25:50,336 INFO L87 Difference]: Start difference. First operand 36239 states and 110962 transitions. Second operand 12 states. [2019-12-27 16:25:53,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:53,642 INFO L93 Difference]: Finished difference Result 86457 states and 261270 transitions. [2019-12-27 16:25:53,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:25:53,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 16:25:53,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:53,776 INFO L225 Difference]: With dead ends: 86457 [2019-12-27 16:25:53,776 INFO L226 Difference]: Without dead ends: 86457 [2019-12-27 16:25:53,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-12-27 16:25:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86457 states. [2019-12-27 16:25:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86457 to 34115. [2019-12-27 16:25:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34115 states. [2019-12-27 16:25:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34115 states to 34115 states and 104428 transitions. [2019-12-27 16:25:54,723 INFO L78 Accepts]: Start accepts. Automaton has 34115 states and 104428 transitions. Word has length 64 [2019-12-27 16:25:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:54,724 INFO L462 AbstractCegarLoop]: Abstraction has 34115 states and 104428 transitions. [2019-12-27 16:25:54,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:25:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 34115 states and 104428 transitions. [2019-12-27 16:25:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:54,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:54,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:54,761 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-27 16:25:54,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1935640731, now seen corresponding path program 11 times [2019-12-27 16:25:54,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:54,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792607202] [2019-12-27 16:25:54,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:54,823 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-27 16:25:54,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792607202] [2019-12-27 16:25:54,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:54,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:25:54,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [461161452] [2019-12-27 16:25:54,824 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:54,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:56,494 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 349 transitions. [2019-12-27 16:25:56,495 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:56,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:56,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:25:56,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:56,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:25:56,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:56,498 INFO L87 Difference]: Start difference. First operand 34115 states and 104428 transitions. Second operand 3 states. [2019-12-27 16:25:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:56,695 INFO L93 Difference]: Finished difference Result 34115 states and 104427 transitions. [2019-12-27 16:25:56,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:25:56,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:25:56,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:56,775 INFO L225 Difference]: With dead ends: 34115 [2019-12-27 16:25:56,776 INFO L226 Difference]: Without dead ends: 34115 [2019-12-27 16:25:56,776 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-27 16:25:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34115 states. [2019-12-27 16:25:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34115 to 29224. [2019-12-27 16:25:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29224 states. [2019-12-27 16:25:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29224 states to 29224 states and 90486 transitions. [2019-12-27 16:25:57,417 INFO L78 Accepts]: Start accepts. Automaton has 29224 states and 90486 transitions. Word has length 64 [2019-12-27 16:25:57,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:57,418 INFO L462 AbstractCegarLoop]: Abstraction has 29224 states and 90486 transitions. [2019-12-27 16:25:57,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 29224 states and 90486 transitions. [2019-12-27 16:25:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:25:57,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:57,450 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-27 16:25:57,450 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-27 16:25:57,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:57,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1480180120, now seen corresponding path program 1 times [2019-12-27 16:25:57,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:57,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28982351] [2019-12-27 16:25:57,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:57,557 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-27 16:25:57,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28982351] [2019-12-27 16:25:57,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:57,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:25:57,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1604338777] [2019-12-27 16:25:57,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:57,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:58,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 323 states and 632 transitions. [2019-12-27 16:25:58,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:58,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:25:58,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:25:58,212 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:25:58,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:25:58,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:58,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:25:58,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:25:58,213 INFO L87 Difference]: Start difference. First operand 29224 states and 90486 transitions. Second operand 12 states. [2019-12-27 16:26:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:02,875 INFO L93 Difference]: Finished difference Result 55885 states and 170450 transitions. [2019-12-27 16:26:02,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 16:26:02,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 16:26:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:02,962 INFO L225 Difference]: With dead ends: 55885 [2019-12-27 16:26:02,963 INFO L226 Difference]: Without dead ends: 55561 [2019-12-27 16:26:02,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=391, Invalid=1415, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 16:26:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55561 states. [2019-12-27 16:26:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55561 to 31764. [2019-12-27 16:26:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31764 states. [2019-12-27 16:26:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31764 states to 31764 states and 98168 transitions. [2019-12-27 16:26:03,865 INFO L78 Accepts]: Start accepts. Automaton has 31764 states and 98168 transitions. Word has length 65 [2019-12-27 16:26:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:03,865 INFO L462 AbstractCegarLoop]: Abstraction has 31764 states and 98168 transitions. [2019-12-27 16:26:03,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:26:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 31764 states and 98168 transitions. [2019-12-27 16:26:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:26:03,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:03,900 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-27 16:26:03,900 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-27 16:26:03,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:03,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2117464962, now seen corresponding path program 2 times [2019-12-27 16:26:03,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:03,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973789521] [2019-12-27 16:26:03,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:03,963 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-27 16:26:03,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973789521] [2019-12-27 16:26:03,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:03,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:03,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [247652476] [2019-12-27 16:26:03,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:03,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:04,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 255 states and 466 transitions. [2019-12-27 16:26:04,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:04,215 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:26:04,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:26:04,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:04,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:26:04,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:26:04,216 INFO L87 Difference]: Start difference. First operand 31764 states and 98168 transitions. Second operand 6 states. [2019-12-27 16:26:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:04,576 INFO L93 Difference]: Finished difference Result 31521 states and 95731 transitions. [2019-12-27 16:26:04,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:26:04,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 16:26:04,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:04,620 INFO L225 Difference]: With dead ends: 31521 [2019-12-27 16:26:04,620 INFO L226 Difference]: Without dead ends: 31521 [2019-12-27 16:26:04,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31521 states. [2019-12-27 16:26:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31521 to 23361. [2019-12-27 16:26:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23361 states. [2019-12-27 16:26:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23361 states to 23361 states and 71626 transitions. [2019-12-27 16:26:05,300 INFO L78 Accepts]: Start accepts. Automaton has 23361 states and 71626 transitions. Word has length 65 [2019-12-27 16:26:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:05,300 INFO L462 AbstractCegarLoop]: Abstraction has 23361 states and 71626 transitions. [2019-12-27 16:26:05,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:26:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 23361 states and 71626 transitions. [2019-12-27 16:26:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:05,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:05,325 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-27 16:26:05,325 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-27 16:26:05,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1338482558, now seen corresponding path program 1 times [2019-12-27 16:26:05,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:05,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194332133] [2019-12-27 16:26:05,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:05,419 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-27 16:26:05,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194332133] [2019-12-27 16:26:05,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:05,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:26:05,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2056812860] [2019-12-27 16:26:05,420 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:05,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:05,778 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 327 states and 673 transitions. [2019-12-27 16:26:05,778 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:06,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:06,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:06,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:06,347 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 16:26:06,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:26:06,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:26:06,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:26:06,348 INFO L87 Difference]: Start difference. First operand 23361 states and 71626 transitions. Second operand 16 states. [2019-12-27 16:26:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:08,316 INFO L93 Difference]: Finished difference Result 39282 states and 118999 transitions. [2019-12-27 16:26:08,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:26:08,316 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 16:26:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:08,363 INFO L225 Difference]: With dead ends: 39282 [2019-12-27 16:26:08,363 INFO L226 Difference]: Without dead ends: 29322 [2019-12-27 16:26:08,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 13 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2019-12-27 16:26:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29322 states. [2019-12-27 16:26:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29322 to 24020. [2019-12-27 16:26:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24020 states. [2019-12-27 16:26:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24020 states to 24020 states and 73102 transitions. [2019-12-27 16:26:08,976 INFO L78 Accepts]: Start accepts. Automaton has 24020 states and 73102 transitions. Word has length 66 [2019-12-27 16:26:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:08,976 INFO L462 AbstractCegarLoop]: Abstraction has 24020 states and 73102 transitions. [2019-12-27 16:26:08,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:26:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 24020 states and 73102 transitions. [2019-12-27 16:26:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:09,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:09,002 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-27 16:26:09,002 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-27 16:26:09,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1029826500, now seen corresponding path program 2 times [2019-12-27 16:26:09,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:09,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428712283] [2019-12-27 16:26:09,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:09,125 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-27 16:26:09,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428712283] [2019-12-27 16:26:09,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:09,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:26:09,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1620198119] [2019-12-27 16:26:09,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:09,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:09,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 504 transitions. [2019-12-27 16:26:09,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:09,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:09,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:09,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:10,043 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 16:26:10,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:26:10,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:26:10,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:26:10,044 INFO L87 Difference]: Start difference. First operand 24020 states and 73102 transitions. Second operand 16 states. [2019-12-27 16:26:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:11,503 INFO L93 Difference]: Finished difference Result 36332 states and 109113 transitions. [2019-12-27 16:26:11,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 16:26:11,503 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 16:26:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:11,541 INFO L225 Difference]: With dead ends: 36332 [2019-12-27 16:26:11,541 INFO L226 Difference]: Without dead ends: 26967 [2019-12-27 16:26:11,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:26:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26967 states. [2019-12-27 16:26:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26967 to 23818. [2019-12-27 16:26:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23818 states. [2019-12-27 16:26:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23818 states to 23818 states and 72460 transitions. [2019-12-27 16:26:12,175 INFO L78 Accepts]: Start accepts. Automaton has 23818 states and 72460 transitions. Word has length 66 [2019-12-27 16:26:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:12,175 INFO L462 AbstractCegarLoop]: Abstraction has 23818 states and 72460 transitions. [2019-12-27 16:26:12,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:26:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 23818 states and 72460 transitions. [2019-12-27 16:26:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:12,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:12,200 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-27 16:26:12,200 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-27 16:26:12,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:12,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1662390436, now seen corresponding path program 3 times [2019-12-27 16:26:12,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:12,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20116595] [2019-12-27 16:26:12,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:12,367 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-27 16:26:12,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20116595] [2019-12-27 16:26:12,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:12,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:26:12,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1603061810] [2019-12-27 16:26:12,368 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:12,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:12,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 307 states and 623 transitions. [2019-12-27 16:26:12,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:13,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:13,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:13,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 16:26:13,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:26:13,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:13,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:26:13,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:26:13,624 INFO L87 Difference]: Start difference. First operand 23818 states and 72460 transitions. Second operand 22 states. [2019-12-27 16:26:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:20,368 INFO L93 Difference]: Finished difference Result 82289 states and 244312 transitions. [2019-12-27 16:26:20,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 16:26:20,374 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-27 16:26:20,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:20,487 INFO L225 Difference]: With dead ends: 82289 [2019-12-27 16:26:20,487 INFO L226 Difference]: Without dead ends: 82289 [2019-12-27 16:26:20,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=639, Invalid=2783, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 16:26:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82289 states. [2019-12-27 16:26:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82289 to 25315. [2019-12-27 16:26:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25315 states. [2019-12-27 16:26:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25315 states to 25315 states and 76839 transitions. [2019-12-27 16:26:21,308 INFO L78 Accepts]: Start accepts. Automaton has 25315 states and 76839 transitions. Word has length 66 [2019-12-27 16:26:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:21,309 INFO L462 AbstractCegarLoop]: Abstraction has 25315 states and 76839 transitions. [2019-12-27 16:26:21,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 16:26:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 25315 states and 76839 transitions. [2019-12-27 16:26:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:21,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:21,337 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-27 16:26:21,337 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:21,337 INFO L82 PathProgramCache]: Analyzing trace with hash -848717318, now seen corresponding path program 4 times [2019-12-27 16:26:21,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:21,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473082268] [2019-12-27 16:26:21,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:21,501 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-27 16:26:21,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473082268] [2019-12-27 16:26:21,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:21,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 16:26:21,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [390727700] [2019-12-27 16:26:21,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:21,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:21,859 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 243 states and 462 transitions. [2019-12-27 16:26:21,859 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:22,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:22,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:22,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 43 times. [2019-12-27 16:26:22,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 16:26:22,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:22,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 16:26:22,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:26:22,740 INFO L87 Difference]: Start difference. First operand 25315 states and 76839 transitions. Second operand 23 states. [2019-12-27 16:26:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:34,923 INFO L93 Difference]: Finished difference Result 80250 states and 237429 transitions. [2019-12-27 16:26:34,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 16:26:34,924 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2019-12-27 16:26:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:35,039 INFO L225 Difference]: With dead ends: 80250 [2019-12-27 16:26:35,039 INFO L226 Difference]: Without dead ends: 80250 [2019-12-27 16:26:35,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=688, Invalid=3344, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 16:26:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80250 states. [2019-12-27 16:26:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80250 to 26269. [2019-12-27 16:26:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26269 states. [2019-12-27 16:26:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26269 states to 26269 states and 79676 transitions. [2019-12-27 16:26:35,886 INFO L78 Accepts]: Start accepts. Automaton has 26269 states and 79676 transitions. Word has length 66 [2019-12-27 16:26:35,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:35,886 INFO L462 AbstractCegarLoop]: Abstraction has 26269 states and 79676 transitions. [2019-12-27 16:26:35,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 16:26:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 26269 states and 79676 transitions. [2019-12-27 16:26:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:35,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:35,925 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-27 16:26:35,925 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1124067425, now seen corresponding path program 1 times [2019-12-27 16:26:35,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:35,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128448169] [2019-12-27 16:26:35,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:35,959 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-27 16:26:35,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128448169] [2019-12-27 16:26:35,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:35,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:35,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1041318553] [2019-12-27 16:26:35,961 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:35,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:36,344 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 442 transitions. [2019-12-27 16:26:36,344 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:36,356 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:26:36,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:36,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:36,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:36,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:36,357 INFO L87 Difference]: Start difference. First operand 26269 states and 79676 transitions. Second operand 3 states. [2019-12-27 16:26:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:36,475 INFO L93 Difference]: Finished difference Result 27650 states and 82344 transitions. [2019-12-27 16:26:36,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:36,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:26:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:36,513 INFO L225 Difference]: With dead ends: 27650 [2019-12-27 16:26:36,513 INFO L226 Difference]: Without dead ends: 27650 [2019-12-27 16:26:36,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27650 states. [2019-12-27 16:26:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27650 to 17140. [2019-12-27 16:26:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-27 16:26:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 50154 transitions. [2019-12-27 16:26:36,851 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 50154 transitions. Word has length 66 [2019-12-27 16:26:36,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:36,851 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 50154 transitions. [2019-12-27 16:26:36,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:36,851 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 50154 transitions. [2019-12-27 16:26:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:36,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:36,870 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-27 16:26:36,870 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:36,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:36,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1940407340, now seen corresponding path program 5 times [2019-12-27 16:26:36,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:36,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055562118] [2019-12-27 16:26:36,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:37,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055562118] [2019-12-27 16:26:37,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:37,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 16:26:37,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1586565912] [2019-12-27 16:26:37,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:37,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:37,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 515 transitions. [2019-12-27 16:26:37,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:37,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:37,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:37,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:38,008 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 42 times. [2019-12-27 16:26:38,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 16:26:38,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:38,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 16:26:38,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:26:38,009 INFO L87 Difference]: Start difference. First operand 17140 states and 50154 transitions. Second operand 24 states. [2019-12-27 16:26:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:45,003 INFO L93 Difference]: Finished difference Result 41592 states and 121296 transitions. [2019-12-27 16:26:45,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 16:26:45,004 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2019-12-27 16:26:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:45,064 INFO L225 Difference]: With dead ends: 41592 [2019-12-27 16:26:45,065 INFO L226 Difference]: Without dead ends: 41592 [2019-12-27 16:26:45,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 16:26:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41592 states. [2019-12-27 16:26:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41592 to 16288. [2019-12-27 16:26:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16288 states. [2019-12-27 16:26:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16288 states to 16288 states and 47718 transitions. [2019-12-27 16:26:45,493 INFO L78 Accepts]: Start accepts. Automaton has 16288 states and 47718 transitions. Word has length 66 [2019-12-27 16:26:45,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:45,493 INFO L462 AbstractCegarLoop]: Abstraction has 16288 states and 47718 transitions. [2019-12-27 16:26:45,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 16:26:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 16288 states and 47718 transitions. [2019-12-27 16:26:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:45,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:45,510 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-27 16:26:45,510 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash 312790614, now seen corresponding path program 6 times [2019-12-27 16:26:45,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:45,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682331419] [2019-12-27 16:26:45,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:45,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682331419] [2019-12-27 16:26:45,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:45,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:26:45,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924073211] [2019-12-27 16:26:45,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:45,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:46,144 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 296 states and 570 transitions. [2019-12-27 16:26:46,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:46,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:46,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:46,731 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 16:26:46,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:26:46,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:46,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:26:46,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:26:46,732 INFO L87 Difference]: Start difference. First operand 16288 states and 47718 transitions. Second operand 22 states. [2019-12-27 16:26:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:49,980 INFO L93 Difference]: Finished difference Result 30736 states and 89544 transitions. [2019-12-27 16:26:49,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 16:26:49,980 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-27 16:26:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:50,017 INFO L225 Difference]: With dead ends: 30736 [2019-12-27 16:26:50,017 INFO L226 Difference]: Without dead ends: 26860 [2019-12-27 16:26:50,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=270, Invalid=1452, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 16:26:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26860 states. [2019-12-27 16:26:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26860 to 16502. [2019-12-27 16:26:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16502 states. [2019-12-27 16:26:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16502 states to 16502 states and 48201 transitions. [2019-12-27 16:26:50,336 INFO L78 Accepts]: Start accepts. Automaton has 16502 states and 48201 transitions. Word has length 66 [2019-12-27 16:26:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:50,336 INFO L462 AbstractCegarLoop]: Abstraction has 16502 states and 48201 transitions. [2019-12-27 16:26:50,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 16:26:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 16502 states and 48201 transitions. [2019-12-27 16:26:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:50,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:50,353 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-27 16:26:50,354 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:50,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:50,354 INFO L82 PathProgramCache]: Analyzing trace with hash -667839678, now seen corresponding path program 7 times [2019-12-27 16:26:50,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:50,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686048902] [2019-12-27 16:26:50,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:50,517 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-27 16:26:50,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686048902] [2019-12-27 16:26:50,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:50,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:26:50,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9878489] [2019-12-27 16:26:50,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:50,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:50,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 293 states and 573 transitions. [2019-12-27 16:26:50,762 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:51,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:51,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:51,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:51,565 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 37 times. [2019-12-27 16:26:51,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:26:51,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:51,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:26:51,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:26:51,567 INFO L87 Difference]: Start difference. First operand 16502 states and 48201 transitions. Second operand 22 states. [2019-12-27 16:26:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:54,317 INFO L93 Difference]: Finished difference Result 29295 states and 84972 transitions. [2019-12-27 16:26:54,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 16:26:54,317 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-27 16:26:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:54,353 INFO L225 Difference]: With dead ends: 29295 [2019-12-27 16:26:54,353 INFO L226 Difference]: Without dead ends: 23937 [2019-12-27 16:26:54,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 16 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=456, Invalid=2196, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 16:26:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23937 states. [2019-12-27 16:26:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23937 to 15484. [2019-12-27 16:26:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15484 states. [2019-12-27 16:26:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15484 states to 15484 states and 45417 transitions. [2019-12-27 16:26:54,654 INFO L78 Accepts]: Start accepts. Automaton has 15484 states and 45417 transitions. Word has length 66 [2019-12-27 16:26:54,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:54,654 INFO L462 AbstractCegarLoop]: Abstraction has 15484 states and 45417 transitions. [2019-12-27 16:26:54,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 16:26:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 15484 states and 45417 transitions. [2019-12-27 16:26:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:54,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:54,672 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-27 16:26:54,672 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:54,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:54,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2048064026, now seen corresponding path program 8 times [2019-12-27 16:26:54,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:54,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909949723] [2019-12-27 16:26:54,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:54,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-27 16:26:54,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909949723] [2019-12-27 16:26:54,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:54,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:26:54,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [617652535] [2019-12-27 16:26:54,770 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:54,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:55,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 304 states and 608 transitions. [2019-12-27 16:26:55,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:55,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:55,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 16:26:55,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:26:55,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:55,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:26:55,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:26:55,256 INFO L87 Difference]: Start difference. First operand 15484 states and 45417 transitions. Second operand 14 states. [2019-12-27 16:26:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:56,878 INFO L93 Difference]: Finished difference Result 21117 states and 61078 transitions. [2019-12-27 16:26:56,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 16:26:56,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 16:26:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:56,902 INFO L225 Difference]: With dead ends: 21117 [2019-12-27 16:26:56,903 INFO L226 Difference]: Without dead ends: 21117 [2019-12-27 16:26:56,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:26:56,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21117 states. [2019-12-27 16:26:57,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21117 to 14032. [2019-12-27 16:26:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14032 states. [2019-12-27 16:26:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14032 states to 14032 states and 41469 transitions. [2019-12-27 16:26:57,140 INFO L78 Accepts]: Start accepts. Automaton has 14032 states and 41469 transitions. Word has length 66 [2019-12-27 16:26:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:57,140 INFO L462 AbstractCegarLoop]: Abstraction has 14032 states and 41469 transitions. [2019-12-27 16:26:57,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:26:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 14032 states and 41469 transitions. [2019-12-27 16:26:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:57,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:57,154 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-27 16:26:57,154 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:57,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:57,155 INFO L82 PathProgramCache]: Analyzing trace with hash -124195356, now seen corresponding path program 9 times [2019-12-27 16:26:57,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:57,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610208418] [2019-12-27 16:26:57,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:57,240 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-27 16:26:57,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610208418] [2019-12-27 16:26:57,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:57,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:26:57,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2112680692] [2019-12-27 16:26:57,241 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:57,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:57,603 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 278 states and 533 transitions. [2019-12-27 16:26:57,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:57,609 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:26:57,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:26:57,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:57,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:26:57,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:26:57,611 INFO L87 Difference]: Start difference. First operand 14032 states and 41469 transitions. Second operand 4 states. [2019-12-27 16:26:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:57,739 INFO L93 Difference]: Finished difference Result 15976 states and 47364 transitions. [2019-12-27 16:26:57,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:57,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 16:26:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:57,767 INFO L225 Difference]: With dead ends: 15976 [2019-12-27 16:26:57,768 INFO L226 Difference]: Without dead ends: 15976 [2019-12-27 16:26:57,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:26:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15976 states. [2019-12-27 16:26:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15976 to 13188. [2019-12-27 16:26:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13188 states. [2019-12-27 16:26:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13188 states to 13188 states and 39269 transitions. [2019-12-27 16:26:58,048 INFO L78 Accepts]: Start accepts. Automaton has 13188 states and 39269 transitions. Word has length 66 [2019-12-27 16:26:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:58,049 INFO L462 AbstractCegarLoop]: Abstraction has 13188 states and 39269 transitions. [2019-12-27 16:26:58,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:26:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 13188 states and 39269 transitions. [2019-12-27 16:26:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:26:58,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:58,061 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-27 16:26:58,062 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:58,062 INFO L82 PathProgramCache]: Analyzing trace with hash 8609018, now seen corresponding path program 1 times [2019-12-27 16:26:58,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:58,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574152438] [2019-12-27 16:26:58,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:58,263 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-27 16:26:58,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574152438] [2019-12-27 16:26:58,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:58,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:26:58,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [76302026] [2019-12-27 16:26:58,264 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:58,278 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:58,597 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 501 transitions. [2019-12-27 16:26:58,598 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:58,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:59,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:59,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:59,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:59,372 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 37 times. [2019-12-27 16:26:59,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:26:59,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:59,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:26:59,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:26:59,373 INFO L87 Difference]: Start difference. First operand 13188 states and 39269 transitions. Second operand 21 states. [2019-12-27 16:27:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:00,671 INFO L93 Difference]: Finished difference Result 16008 states and 47285 transitions. [2019-12-27 16:27:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:27:00,672 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-27 16:27:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:00,698 INFO L225 Difference]: With dead ends: 16008 [2019-12-27 16:27:00,698 INFO L226 Difference]: Without dead ends: 15587 [2019-12-27 16:27:00,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 14 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 16:27:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15587 states. [2019-12-27 16:27:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15587 to 12934. [2019-12-27 16:27:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12934 states. [2019-12-27 16:27:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12934 states to 12934 states and 38625 transitions. [2019-12-27 16:27:00,925 INFO L78 Accepts]: Start accepts. Automaton has 12934 states and 38625 transitions. Word has length 67 [2019-12-27 16:27:00,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:00,925 INFO L462 AbstractCegarLoop]: Abstraction has 12934 states and 38625 transitions. [2019-12-27 16:27:00,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:27:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 12934 states and 38625 transitions. [2019-12-27 16:27:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:27:00,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:00,938 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-27 16:27:00,938 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:00,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:00,939 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 2 times [2019-12-27 16:27:00,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:00,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322381809] [2019-12-27 16:27:00,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:27:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:27:01,065 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:27:01,066 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:27:01,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t651~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t651~0.base_24|) |v_ULTIMATE.start_main_~#t651~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t651~0.base_24|)) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (= v_~main$tmp_guard1~0_29 0) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t651~0.base_24|) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= |v_ULTIMATE.start_main_~#t651~0.offset_19| 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t651~0.base_24| 1)) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t651~0.base_24| 4)) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ULTIMATE.start_main_~#t653~0.base=|v_ULTIMATE.start_main_~#t653~0.base_27|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ULTIMATE.start_main_~#t652~0.base=|v_ULTIMATE.start_main_~#t652~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t651~0.offset=|v_ULTIMATE.start_main_~#t651~0.offset_19|, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ULTIMATE.start_main_~#t651~0.base=|v_ULTIMATE.start_main_~#t651~0.base_24|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ~y~0=v_~y~0_39, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ULTIMATE.start_main_~#t653~0.offset=|v_ULTIMATE.start_main_~#t653~0.offset_20|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_~#t652~0.offset=|v_ULTIMATE.start_main_~#t652~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t653~0.base, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t652~0.base, ~__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, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t651~0.offset, ~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, ULTIMATE.start_main_~#t651~0.base, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t653~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_~#t652~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 16:27:01,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t652~0.base_10| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t652~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t652~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t652~0.base_10|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t652~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t652~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t652~0.base_10|) |v_ULTIMATE.start_main_~#t652~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t652~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t652~0.base=|v_ULTIMATE.start_main_~#t652~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t652~0.offset=|v_ULTIMATE.start_main_~#t652~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t652~0.base, ULTIMATE.start_main_~#t652~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 16:27:01,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t653~0.base_13| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t653~0.base_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t653~0.base_13| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t653~0.base_13|)) (= |v_ULTIMATE.start_main_~#t653~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t653~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t653~0.base_13|) |v_ULTIMATE.start_main_~#t653~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t653~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t653~0.offset=|v_ULTIMATE.start_main_~#t653~0.offset_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t653~0.base=|v_ULTIMATE.start_main_~#t653~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t653~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t653~0.base] because there is no mapped edge [2019-12-27 16:27:01,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 16:27:01,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1525156330 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1525156330 256) 0))) (or (and (= ~a~0_In-1525156330 |P1Thread1of1ForFork2_#t~ite9_Out-1525156330|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1525156330| ~a$w_buff1~0_In-1525156330) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-1525156330, ~a$w_buff1~0=~a$w_buff1~0_In-1525156330, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1525156330, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1525156330} OutVars{~a~0=~a~0_In-1525156330, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1525156330|, ~a$w_buff1~0=~a$w_buff1~0_In-1525156330, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1525156330, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1525156330} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 16:27:01,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-188480637 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-188480637 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-188480637 |P0Thread1of1ForFork1_#t~ite5_Out-188480637|)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-188480637| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-188480637, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-188480637} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-188480637|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-188480637, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-188480637} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:27:01,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In87605189 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In87605189 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In87605189 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In87605189 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out87605189|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In87605189 |P0Thread1of1ForFork1_#t~ite6_Out87605189|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In87605189, ~a$w_buff0_used~0=~a$w_buff0_used~0_In87605189, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In87605189, ~a$w_buff1_used~0=~a$w_buff1_used~0_In87605189} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out87605189|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In87605189, ~a$w_buff0_used~0=~a$w_buff0_used~0_In87605189, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In87605189, ~a$w_buff1_used~0=~a$w_buff1_used~0_In87605189} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:27:01,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1838480668 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1838480668 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out1838480668 ~a$r_buff0_thd1~0_In1838480668)) (and (not .cse1) (not .cse0) (= ~a$r_buff0_thd1~0_Out1838480668 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1838480668, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1838480668} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1838480668|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1838480668, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1838480668} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:27:01,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In338997185 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In338997185 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In338997185 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In338997185 256) 0))) (or (and (= ~a$r_buff1_thd1~0_In338997185 |P0Thread1of1ForFork1_#t~ite8_Out338997185|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out338997185|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In338997185, ~a$w_buff0_used~0=~a$w_buff0_used~0_In338997185, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In338997185, ~a$w_buff1_used~0=~a$w_buff1_used~0_In338997185} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out338997185|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In338997185, ~a$w_buff0_used~0=~a$w_buff0_used~0_In338997185, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In338997185, ~a$w_buff1_used~0=~a$w_buff1_used~0_In338997185} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:27:01,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:27:01,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-471366586 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In-471366586| |P2Thread1of1ForFork0_#t~ite20_Out-471366586|) (= |P2Thread1of1ForFork0_#t~ite21_Out-471366586| ~a$w_buff0~0_In-471366586) (not .cse0)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-471366586 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In-471366586 256) 0)) (and (= (mod ~a$r_buff1_thd3~0_In-471366586 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-471366586 256)))) (= ~a$w_buff0~0_In-471366586 |P2Thread1of1ForFork0_#t~ite20_Out-471366586|) .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out-471366586| |P2Thread1of1ForFork0_#t~ite20_Out-471366586|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-471366586, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-471366586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-471366586, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-471366586, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-471366586, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-471366586|, ~weak$$choice2~0=~weak$$choice2~0_In-471366586} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-471366586|, ~a$w_buff0~0=~a$w_buff0~0_In-471366586, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-471366586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-471366586, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-471366586, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-471366586|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-471366586, ~weak$$choice2~0=~weak$$choice2~0_In-471366586} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 16:27:01,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2132262809 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_Out2132262809| |P2Thread1of1ForFork0_#t~ite27_Out2132262809|) (= |P2Thread1of1ForFork0_#t~ite26_Out2132262809| ~a$w_buff0_used~0_In2132262809) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2132262809 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In2132262809 256)) .cse1) (and (= 0 (mod ~a$r_buff1_thd3~0_In2132262809 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In2132262809 256))))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out2132262809| ~a$w_buff0_used~0_In2132262809) (= |P2Thread1of1ForFork0_#t~ite26_In2132262809| |P2Thread1of1ForFork0_#t~ite26_Out2132262809|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In2132262809|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2132262809, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2132262809, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2132262809, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2132262809, ~weak$$choice2~0=~weak$$choice2~0_In2132262809} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out2132262809|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out2132262809|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2132262809, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2132262809, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2132262809, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2132262809, ~weak$$choice2~0=~weak$$choice2~0_In2132262809} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 16:27:01,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1997272490 256)))) (or (and (= ~a$w_buff1_used~0_In-1997272490 |P2Thread1of1ForFork0_#t~ite29_Out-1997272490|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1997272490 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-1997272490 256) 0)) (and (= (mod ~a$w_buff1_used~0_In-1997272490 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1997272490 256)))) (= |P2Thread1of1ForFork0_#t~ite30_Out-1997272490| |P2Thread1of1ForFork0_#t~ite29_Out-1997272490|)) (and (= |P2Thread1of1ForFork0_#t~ite30_Out-1997272490| ~a$w_buff1_used~0_In-1997272490) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite29_In-1997272490| |P2Thread1of1ForFork0_#t~ite29_Out-1997272490|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1997272490, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1997272490, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1997272490, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1997272490, ~weak$$choice2~0=~weak$$choice2~0_In-1997272490, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1997272490|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1997272490, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1997272490, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1997272490, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1997272490|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1997272490, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1997272490|, ~weak$$choice2~0=~weak$$choice2~0_In-1997272490} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:27:01,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 16:27:01,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:27:01,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-512266728 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-512266728 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-512266728| ~a$w_buff0_used~0_In-512266728)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-512266728|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-512266728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-512266728} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-512266728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-512266728, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-512266728|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:27:01,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-240449765 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-240449765 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-240449765 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-240449765 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-240449765|)) (and (= ~a$w_buff1_used~0_In-240449765 |P1Thread1of1ForFork2_#t~ite12_Out-240449765|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-240449765, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-240449765, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-240449765, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-240449765} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-240449765, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-240449765, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-240449765, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-240449765|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-240449765} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:27:01,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1908922775 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1908922775 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out1908922775| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out1908922775| ~a$r_buff0_thd2~0_In1908922775) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1908922775, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1908922775} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1908922775, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1908922775, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1908922775|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:27:01,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1303887060 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In1303887060 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1303887060 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1303887060 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out1303887060| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1303887060| ~a$r_buff1_thd2~0_In1303887060) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1303887060, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1303887060, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303887060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303887060} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1303887060, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1303887060, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303887060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303887060, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1303887060|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:27:01,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:27:01,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 16:27:01,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out196435051| |P2Thread1of1ForFork0_#t~ite38_Out196435051|)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In196435051 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In196435051 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out196435051| ~a$w_buff1~0_In196435051)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out196435051| ~a~0_In196435051) (or .cse1 .cse2)))) InVars {~a~0=~a~0_In196435051, ~a$w_buff1~0=~a$w_buff1~0_In196435051, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In196435051, ~a$w_buff1_used~0=~a$w_buff1_used~0_In196435051} OutVars{~a~0=~a~0_In196435051, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out196435051|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out196435051|, ~a$w_buff1~0=~a$w_buff1~0_In196435051, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In196435051, ~a$w_buff1_used~0=~a$w_buff1_used~0_In196435051} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:27:01,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1480443862 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1480443862 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1480443862|)) (and (= ~a$w_buff0_used~0_In-1480443862 |P2Thread1of1ForFork0_#t~ite40_Out-1480443862|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1480443862, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1480443862} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1480443862|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1480443862, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1480443862} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:27:01,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1141933146 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1141933146 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In1141933146 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In1141933146 256)))) (or (and (= ~a$w_buff1_used~0_In1141933146 |P2Thread1of1ForFork0_#t~ite41_Out1141933146|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1141933146|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1141933146, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1141933146, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1141933146, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1141933146} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1141933146, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1141933146, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1141933146, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1141933146, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1141933146|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:27:01,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In596204212 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In596204212 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out596204212|)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd3~0_In596204212 |P2Thread1of1ForFork0_#t~ite42_Out596204212|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In596204212, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In596204212} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In596204212, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In596204212, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out596204212|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:27:01,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In-402431534 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-402431534 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-402431534 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-402431534 256)))) (or (and (= ~a$r_buff1_thd3~0_In-402431534 |P2Thread1of1ForFork0_#t~ite43_Out-402431534|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-402431534|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-402431534, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-402431534, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-402431534, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-402431534} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-402431534|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-402431534, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-402431534, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-402431534, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-402431534} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:27:01,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:27:01,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:27:01,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-363058734| |ULTIMATE.start_main_#t~ite48_Out-363058734|)) (.cse1 (= (mod ~a$w_buff1_used~0_In-363058734 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-363058734 256)))) (or (and (= ~a$w_buff1~0_In-363058734 |ULTIMATE.start_main_#t~ite47_Out-363058734|) .cse0 (not .cse1) (not .cse2)) (and .cse0 (= ~a~0_In-363058734 |ULTIMATE.start_main_#t~ite47_Out-363058734|) (or .cse1 .cse2)))) InVars {~a~0=~a~0_In-363058734, ~a$w_buff1~0=~a$w_buff1~0_In-363058734, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-363058734, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-363058734} OutVars{~a~0=~a~0_In-363058734, ~a$w_buff1~0=~a$w_buff1~0_In-363058734, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-363058734|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-363058734, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-363058734|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-363058734} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 16:27:01,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In800831541 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In800831541 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out800831541| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out800831541| ~a$w_buff0_used~0_In800831541) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In800831541, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In800831541} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In800831541, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out800831541|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In800831541} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:27:01,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd0~0_In1842233584 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1842233584 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1842233584 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1842233584 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1842233584|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In1842233584 |ULTIMATE.start_main_#t~ite50_Out1842233584|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1842233584, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1842233584, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1842233584, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1842233584} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1842233584|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1842233584, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1842233584, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1842233584, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1842233584} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:27:01,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-56440358 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-56440358 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-56440358| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-56440358| ~a$r_buff0_thd0~0_In-56440358)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-56440358, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-56440358} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-56440358|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-56440358, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-56440358} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:27:01,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1503297154 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1503297154 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1503297154 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1503297154 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1503297154|)) (and (= ~a$r_buff1_thd0~0_In-1503297154 |ULTIMATE.start_main_#t~ite52_Out-1503297154|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1503297154, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1503297154, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1503297154, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503297154} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1503297154|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1503297154, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1503297154, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1503297154, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503297154} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:27:01,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} 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-27 16:27:01,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:27:01 BasicIcfg [2019-12-27 16:27:01,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:27:01,212 INFO L168 Benchmark]: Toolchain (without parser) took 185127.20 ms. Allocated memory was 136.8 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 99.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 16:27:01,212 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 16:27:01,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.75 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.3 MB in the beginning and 153.3 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:01,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.75 ms. Allocated memory is still 200.3 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:01,215 INFO L168 Benchmark]: Boogie Preprocessor took 40.72 ms. Allocated memory is still 200.3 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:01,216 INFO L168 Benchmark]: RCFGBuilder took 852.94 ms. Allocated memory is still 200.3 MB. Free memory was 148.5 MB in the beginning and 97.6 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:01,216 INFO L168 Benchmark]: TraceAbstraction took 183391.37 ms. Allocated memory was 200.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 97.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 958.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:01,218 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.75 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.3 MB in the beginning and 153.3 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.75 ms. Allocated memory is still 200.3 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.72 ms. Allocated memory is still 200.3 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.94 ms. Allocated memory is still 200.3 MB. Free memory was 148.5 MB in the beginning and 97.6 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 183391.37 ms. Allocated memory was 200.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 97.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 958.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t651, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_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] [L837] FCALL, FORK 0 pthread_create(&t652, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t653, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_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=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=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_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=0, z=0] [L756] 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_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_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=1] [L776] 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_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=1] [L756] 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) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L800] 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)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L758] 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 [L800] 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) [L801] 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)) [L802] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=2] [L802] 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)) [L803] 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)) [L804] 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)) [L806] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, 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, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 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 [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 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)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 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 [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, 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=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 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 [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 183.0s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 83.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9668 SDtfs, 20548 SDslu, 45346 SDs, 0 SdLazy, 42218 SolverSat, 1389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1308 GetRequests, 431 SyntacticMatches, 189 SemanticMatches, 688 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6309 ImplicationChecksByTransitivity, 18.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred 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: 47.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 512547 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1961 NumberOfCodeBlocks, 1961 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1858 ConstructedInterpolants, 0 QuantifiedInterpolants, 409908 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...