/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:01:31,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:01:31,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:01:31,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:01:31,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:01:31,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:01:31,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:01:31,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:01:31,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:01:31,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:01:31,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:01:31,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:01:31,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:01:31,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:01:31,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:01:31,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:01:31,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:01:31,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:01:31,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:01:31,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:01:31,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:01:31,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:01:31,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:01:31,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:01:31,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:01:31,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:01:31,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:01:31,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:01:31,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:01:31,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:01:31,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:01:31,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:01:31,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:01:31,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:01:31,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:01:31,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:01:31,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:01:31,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:01:31,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:01:31,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:01:31,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:01:31,814 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:01:31,835 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:01:31,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:01:31,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:01:31,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:01:31,838 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:01:31,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:01:31,838 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:01:31,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:01:31,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:01:31,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:01:31,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:01:31,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:01:31,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:01:31,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:01:31,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:01:31,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:01:31,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:01:31,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:01:31,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:01:31,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:01:31,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:01:31,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:01:31,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:01:31,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:01:31,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:01:31,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:01:31,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:01:31,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:01:31,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:01:31,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:01:32,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:01:32,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:01:32,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:01:32,182 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:01:32,182 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:01:32,183 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-26 22:01:32,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856c2a3fb/5b108305a9924441aad940940a4b7d3b/FLAG9df970697 [2019-12-26 22:01:32,831 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:01:32,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_tso.opt.i [2019-12-26 22:01:32,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856c2a3fb/5b108305a9924441aad940940a4b7d3b/FLAG9df970697 [2019-12-26 22:01:33,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/856c2a3fb/5b108305a9924441aad940940a4b7d3b [2019-12-26 22:01:33,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:01:33,060 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:01:33,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:01:33,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:01:33,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:01:33,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:01:33" (1/1) ... [2019-12-26 22:01:33,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b1d233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33, skipping insertion in model container [2019-12-26 22:01:33,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:01:33" (1/1) ... [2019-12-26 22:01:33,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:01:33,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:01:33,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:01:33,646 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:01:33,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:01:33,803 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:01:33,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33 WrapperNode [2019-12-26 22:01:33,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:01:33,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:01:33,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:01:33,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:01:33,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33" (1/1) ... [2019-12-26 22:01:33,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33" (1/1) ... [2019-12-26 22:01:33,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:01:33,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:01:33,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:01:33,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:01:33,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33" (1/1) ... [2019-12-26 22:01:33,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33" (1/1) ... [2019-12-26 22:01:33,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33" (1/1) ... [2019-12-26 22:01:33,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33" (1/1) ... [2019-12-26 22:01:33,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33" (1/1) ... [2019-12-26 22:01:33,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33" (1/1) ... [2019-12-26 22:01:33,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33" (1/1) ... [2019-12-26 22:01:33,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:01:33,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:01:33,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:01:33,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:01:33,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:01:33,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:01:33,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:01:34,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:01:34,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:01:34,000 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:01:34,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:01:34,000 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:01:34,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:01:34,001 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:01:34,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:01:34,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:01:34,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:01:34,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:01:34,003 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:01:34,755 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:01:34,756 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:01:34,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:01:34 BoogieIcfgContainer [2019-12-26 22:01:34,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:01:34,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:01:34,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:01:34,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:01:34,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:01:33" (1/3) ... [2019-12-26 22:01:34,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6a69df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:01:34, skipping insertion in model container [2019-12-26 22:01:34,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:33" (2/3) ... [2019-12-26 22:01:34,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6a69df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:01:34, skipping insertion in model container [2019-12-26 22:01:34,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:01:34" (3/3) ... [2019-12-26 22:01:34,766 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_tso.opt.i [2019-12-26 22:01:34,776 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:01:34,776 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:01:34,783 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:01:34,784 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:01:34,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,828 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,828 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,828 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,853 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,853 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,918 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,920 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,937 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,937 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:34,956 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:01:34,974 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:01:34,974 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:01:34,974 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:01:34,974 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:01:34,974 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:01:34,974 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:01:34,975 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:01:34,975 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:01:34,991 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-26 22:01:34,993 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 22:01:35,111 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 22:01:35,111 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:01:35,131 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:01:35,157 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 22:01:35,255 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 22:01:35,255 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:01:35,266 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:01:35,290 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:01:35,291 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:01:40,715 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 22:01:40,849 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:01:41,117 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-26 22:01:41,117 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-26 22:01:41,121 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-26 22:02:03,648 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-26 22:02:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-26 22:02:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:02:03,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:03,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:02:03,656 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:03,661 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-26 22:02:03,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:03,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97542746] [2019-12-26 22:02:03,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:03,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97542746] [2019-12-26 22:02:03,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:03,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:02:03,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492537029] [2019-12-26 22:02:03,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:02:03,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:03,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:02:03,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:02:03,941 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-26 22:02:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:07,138 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-26 22:02:07,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:02:07,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:02:07,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:07,794 INFO L225 Difference]: With dead ends: 121140 [2019-12-26 22:02:07,794 INFO L226 Difference]: Without dead ends: 107958 [2019-12-26 22:02:07,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:02:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-26 22:02:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-26 22:02:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-26 22:02:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-26 22:02:22,168 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-26 22:02:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:22,168 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-26 22:02:22,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:02:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-26 22:02:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:02:22,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:22,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:22,173 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:22,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:22,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-26 22:02:22,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:22,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436403272] [2019-12-26 22:02:22,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:22,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436403272] [2019-12-26 22:02:22,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:22,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:02:22,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343197772] [2019-12-26 22:02:22,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:02:22,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:02:22,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:02:22,260 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-26 22:02:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:23,494 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-26 22:02:23,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:02:23,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:02:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:29,083 INFO L225 Difference]: With dead ends: 172022 [2019-12-26 22:02:29,083 INFO L226 Difference]: Without dead ends: 171924 [2019-12-26 22:02:29,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-26 22:02:38,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-26 22:02:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-26 22:02:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-26 22:02:45,501 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-26 22:02:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:45,501 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-26 22:02:45,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:02:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-26 22:02:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:02:45,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:45,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:45,510 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:45,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:45,511 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-26 22:02:45,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:45,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310251630] [2019-12-26 22:02:45,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:45,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310251630] [2019-12-26 22:02:45,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:45,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:02:45,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600902845] [2019-12-26 22:02:45,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:02:45,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:45,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:02:45,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:02:45,581 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-26 22:02:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:45,723 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-26 22:02:45,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:02:45,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:02:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:45,779 INFO L225 Difference]: With dead ends: 33388 [2019-12-26 22:02:45,779 INFO L226 Difference]: Without dead ends: 33388 [2019-12-26 22:02:45,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:02:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-26 22:02:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-26 22:02:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-26 22:02:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-26 22:02:46,400 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-26 22:02:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:46,400 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-26 22:02:46,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:02:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-26 22:02:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:02:46,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:46,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:46,404 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-26 22:02:46,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:46,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099054918] [2019-12-26 22:02:46,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:46,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099054918] [2019-12-26 22:02:46,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:46,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:46,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600563995] [2019-12-26 22:02:46,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:02:46,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:46,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:02:46,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:02:46,474 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-26 22:02:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:46,731 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-26 22:02:46,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:02:46,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 22:02:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:46,824 INFO L225 Difference]: With dead ends: 52822 [2019-12-26 22:02:46,824 INFO L226 Difference]: Without dead ends: 52822 [2019-12-26 22:02:46,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:02:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-26 22:02:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-26 22:02:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-26 22:02:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-26 22:02:48,716 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-26 22:02:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:48,717 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-26 22:02:48,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:02:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-26 22:02:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:02:48,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:48,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:48,721 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-26 22:02:48,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:48,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403029355] [2019-12-26 22:02:48,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:48,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403029355] [2019-12-26 22:02:48,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:48,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:02:48,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214641016] [2019-12-26 22:02:48,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:02:48,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:48,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:02:48,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:02:48,835 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-26 22:02:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:49,307 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-26 22:02:49,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:02:49,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:02:49,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:49,425 INFO L225 Difference]: With dead ends: 46903 [2019-12-26 22:02:49,425 INFO L226 Difference]: Without dead ends: 46903 [2019-12-26 22:02:49,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-26 22:02:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-26 22:02:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-26 22:02:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-26 22:02:50,493 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-26 22:02:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:50,493 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-26 22:02:50,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:02:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-26 22:02:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:02:50,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:50,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:50,497 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:50,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:50,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-26 22:02:50,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:50,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420155916] [2019-12-26 22:02:50,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:50,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420155916] [2019-12-26 22:02:50,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:50,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:02:50,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893142972] [2019-12-26 22:02:50,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:02:50,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:02:50,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:02:50,564 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-26 22:02:50,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:50,928 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-26 22:02:50,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:02:50,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:02:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:51,017 INFO L225 Difference]: With dead ends: 51478 [2019-12-26 22:02:51,017 INFO L226 Difference]: Without dead ends: 51478 [2019-12-26 22:02:51,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-26 22:02:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-26 22:02:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-26 22:02:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-26 22:02:52,422 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-26 22:02:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:52,422 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-26 22:02:52,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:02:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-26 22:02:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:02:52,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:52,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:52,433 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:52,433 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-26 22:02:52,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:52,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333312956] [2019-12-26 22:02:52,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:52,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333312956] [2019-12-26 22:02:52,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:52,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:52,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597099305] [2019-12-26 22:02:52,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:02:52,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:52,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:02:52,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:52,507 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-26 22:02:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:53,183 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-26 22:02:53,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:02:53,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:02:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:53,305 INFO L225 Difference]: With dead ends: 61264 [2019-12-26 22:02:53,305 INFO L226 Difference]: Without dead ends: 61250 [2019-12-26 22:02:53,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:02:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-26 22:02:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-26 22:02:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-26 22:02:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-26 22:02:54,860 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-26 22:02:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:54,861 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-26 22:02:54,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:02:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-26 22:02:54,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:02:54,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:54,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:54,870 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:54,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:54,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-26 22:02:54,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:54,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087437480] [2019-12-26 22:02:54,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:54,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087437480] [2019-12-26 22:02:54,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:54,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:54,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683853612] [2019-12-26 22:02:54,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:02:54,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:54,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:02:54,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:54,956 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-26 22:02:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:55,578 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-26 22:02:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:02:55,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:02:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:55,689 INFO L225 Difference]: With dead ends: 63752 [2019-12-26 22:02:55,689 INFO L226 Difference]: Without dead ends: 63738 [2019-12-26 22:02:55,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:02:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-26 22:02:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-26 22:02:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-26 22:02:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-26 22:02:56,597 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-26 22:02:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:56,597 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-26 22:02:56,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:02:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-26 22:02:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:02:56,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:56,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:56,609 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-26 22:02:56,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:56,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035657906] [2019-12-26 22:02:56,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:56,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035657906] [2019-12-26 22:02:56,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:56,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:56,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477928787] [2019-12-26 22:02:56,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:02:56,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:56,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:02:56,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:02:56,675 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-26 22:02:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:56,745 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-26 22:02:56,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:02:56,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:02:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:57,322 INFO L225 Difference]: With dead ends: 17193 [2019-12-26 22:02:57,323 INFO L226 Difference]: Without dead ends: 17193 [2019-12-26 22:02:57,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:02:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-26 22:02:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-26 22:02:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-26 22:02:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-26 22:02:57,573 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-26 22:02:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:57,574 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-26 22:02:57,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:02:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-26 22:02:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:02:57,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:57,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:57,586 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:57,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-26 22:02:57,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:57,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042083502] [2019-12-26 22:02:57,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:57,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042083502] [2019-12-26 22:02:57,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:57,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:57,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167276425] [2019-12-26 22:02:57,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:02:57,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:57,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:02:57,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:57,668 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-26 22:02:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:57,988 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-26 22:02:57,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:02:57,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 22:02:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:58,019 INFO L225 Difference]: With dead ends: 21613 [2019-12-26 22:02:58,019 INFO L226 Difference]: Without dead ends: 21613 [2019-12-26 22:02:58,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:02:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-26 22:02:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-26 22:02:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-26 22:02:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-26 22:02:58,327 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-26 22:02:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:58,327 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-26 22:02:58,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:02:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-26 22:02:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:02:58,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:58,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:58,342 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:58,343 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-26 22:02:58,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:58,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550677159] [2019-12-26 22:02:58,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:58,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550677159] [2019-12-26 22:02:58,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:58,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:58,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446116493] [2019-12-26 22:02:58,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:02:58,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:58,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:02:58,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:58,417 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-26 22:02:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:58,758 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-26 22:02:58,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:02:58,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 22:02:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:58,793 INFO L225 Difference]: With dead ends: 23624 [2019-12-26 22:02:58,794 INFO L226 Difference]: Without dead ends: 23624 [2019-12-26 22:02:58,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:02:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-26 22:02:59,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-26 22:02:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-26 22:02:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-26 22:02:59,111 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-26 22:02:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:59,111 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-26 22:02:59,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:02:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-26 22:02:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 22:02:59,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:59,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:59,131 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:59,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:59,131 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-26 22:02:59,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:59,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661844650] [2019-12-26 22:02:59,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:02:59,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661844650] [2019-12-26 22:02:59,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:59,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:02:59,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943880851] [2019-12-26 22:02:59,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:02:59,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:59,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:02:59,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:02:59,267 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-26 22:02:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:59,986 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-26 22:02:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:02:59,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-26 22:02:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:00,026 INFO L225 Difference]: With dead ends: 27031 [2019-12-26 22:03:00,026 INFO L226 Difference]: Without dead ends: 27031 [2019-12-26 22:03:00,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:03:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-26 22:03:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-26 22:03:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-26 22:03:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-26 22:03:00,823 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-26 22:03:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:00,824 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-26 22:03:00,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:03:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-26 22:03:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:03:00,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:00,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:00,847 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-26 22:03:00,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:00,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586735087] [2019-12-26 22:03:00,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:00,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586735087] [2019-12-26 22:03:00,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:00,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:03:00,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474008867] [2019-12-26 22:03:00,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:03:00,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:03:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:03:00,926 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-26 22:03:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:01,704 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-26 22:03:01,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:03:01,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-26 22:03:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:01,744 INFO L225 Difference]: With dead ends: 26334 [2019-12-26 22:03:01,744 INFO L226 Difference]: Without dead ends: 26334 [2019-12-26 22:03:01,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:03:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-26 22:03:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-26 22:03:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-26 22:03:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-26 22:03:02,062 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-26 22:03:02,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:02,062 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-26 22:03:02,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:03:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-26 22:03:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:03:02,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:02,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:02,079 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:02,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-26 22:03:02,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:02,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141308438] [2019-12-26 22:03:02,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:02,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141308438] [2019-12-26 22:03:02,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:02,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:03:02,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315868130] [2019-12-26 22:03:02,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:03:02,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:02,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:03:02,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:03:02,142 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-26 22:03:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:02,214 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-26 22:03:02,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:03:02,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:03:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:02,248 INFO L225 Difference]: With dead ends: 17641 [2019-12-26 22:03:02,248 INFO L226 Difference]: Without dead ends: 17641 [2019-12-26 22:03:02,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:03:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-26 22:03:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-26 22:03:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-26 22:03:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-26 22:03:02,535 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-26 22:03:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:02,536 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-26 22:03:02,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:03:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-26 22:03:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:03:02,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:02,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:02,555 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:02,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-26 22:03:02,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:02,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638704284] [2019-12-26 22:03:02,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:02,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638704284] [2019-12-26 22:03:02,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:02,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:03:02,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950475135] [2019-12-26 22:03:02,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:03:02,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:02,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:03:02,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:03:02,630 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-26 22:03:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:03,329 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-26 22:03:03,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:03:03,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:03:03,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:03,382 INFO L225 Difference]: With dead ends: 25346 [2019-12-26 22:03:03,383 INFO L226 Difference]: Without dead ends: 25346 [2019-12-26 22:03:03,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:03:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-26 22:03:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-26 22:03:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-26 22:03:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-26 22:03:03,960 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-26 22:03:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:03,961 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-26 22:03:03,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:03:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-26 22:03:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:03:04,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:04,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:04,490 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:04,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:04,490 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-26 22:03:04,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:04,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810223790] [2019-12-26 22:03:04,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:04,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810223790] [2019-12-26 22:03:04,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:04,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:03:04,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743774986] [2019-12-26 22:03:04,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:03:04,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:04,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:03:04,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:03:04,549 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-26 22:03:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:04,658 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-26 22:03:04,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:03:04,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:03:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:04,692 INFO L225 Difference]: With dead ends: 22175 [2019-12-26 22:03:04,693 INFO L226 Difference]: Without dead ends: 22175 [2019-12-26 22:03:04,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:03:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-26 22:03:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-26 22:03:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-26 22:03:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-26 22:03:05,024 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-26 22:03:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:05,024 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-26 22:03:05,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:03:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-26 22:03:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:03:05,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:05,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:05,055 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-26 22:03:05,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:05,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794098516] [2019-12-26 22:03:05,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:05,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794098516] [2019-12-26 22:03:05,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:05,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:03:05,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296453141] [2019-12-26 22:03:05,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:03:05,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:05,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:03:05,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:03:05,143 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-26 22:03:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:05,707 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-26 22:03:05,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:03:05,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:03:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:05,780 INFO L225 Difference]: With dead ends: 62478 [2019-12-26 22:03:05,780 INFO L226 Difference]: Without dead ends: 47634 [2019-12-26 22:03:05,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:03:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-26 22:03:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-26 22:03:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-26 22:03:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-26 22:03:06,356 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-26 22:03:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:06,356 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-26 22:03:06,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:03:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-26 22:03:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:03:06,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:06,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:06,387 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:06,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:06,387 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-26 22:03:06,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:06,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722796066] [2019-12-26 22:03:06,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:06,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722796066] [2019-12-26 22:03:06,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:06,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:03:06,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146990129] [2019-12-26 22:03:06,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:03:06,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:06,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:03:06,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:03:06,497 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-26 22:03:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:07,052 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-26 22:03:07,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:03:07,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:03:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:07,131 INFO L225 Difference]: With dead ends: 68433 [2019-12-26 22:03:07,131 INFO L226 Difference]: Without dead ends: 48478 [2019-12-26 22:03:07,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:03:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-26 22:03:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-26 22:03:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-26 22:03:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-26 22:03:08,272 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-26 22:03:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:08,273 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-26 22:03:08,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:03:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-26 22:03:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:03:08,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:08,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:08,308 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:08,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:08,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-26 22:03:08,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:08,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155384536] [2019-12-26 22:03:08,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:08,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155384536] [2019-12-26 22:03:08,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:08,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:03:08,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913542783] [2019-12-26 22:03:08,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:03:08,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:08,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:03:08,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:03:08,416 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-26 22:03:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:08,931 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-26 22:03:08,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:03:08,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:03:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:09,013 INFO L225 Difference]: With dead ends: 59843 [2019-12-26 22:03:09,013 INFO L226 Difference]: Without dead ends: 52762 [2019-12-26 22:03:09,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:03:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-26 22:03:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-26 22:03:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-26 22:03:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-26 22:03:09,644 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-26 22:03:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:09,644 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-26 22:03:09,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:03:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-26 22:03:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:03:09,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:09,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:09,676 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:09,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:09,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-26 22:03:09,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:09,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232757350] [2019-12-26 22:03:09,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:09,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232757350] [2019-12-26 22:03:09,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:09,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:03:09,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592459043] [2019-12-26 22:03:09,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:03:09,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:09,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:03:09,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:03:09,781 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 7 states. [2019-12-26 22:03:11,158 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-26 22:03:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:11,438 INFO L93 Difference]: Finished difference Result 38094 states and 116230 transitions. [2019-12-26 22:03:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:03:11,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:03:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:11,494 INFO L225 Difference]: With dead ends: 38094 [2019-12-26 22:03:11,494 INFO L226 Difference]: Without dead ends: 37870 [2019-12-26 22:03:11,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:03:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37870 states. [2019-12-26 22:03:11,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37870 to 31894. [2019-12-26 22:03:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31894 states. [2019-12-26 22:03:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31894 states to 31894 states and 98893 transitions. [2019-12-26 22:03:12,033 INFO L78 Accepts]: Start accepts. Automaton has 31894 states and 98893 transitions. Word has length 63 [2019-12-26 22:03:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:12,034 INFO L462 AbstractCegarLoop]: Abstraction has 31894 states and 98893 transitions. [2019-12-26 22:03:12,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:03:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 31894 states and 98893 transitions. [2019-12-26 22:03:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:03:12,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:12,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:12,072 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-26 22:03:12,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:12,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88436620] [2019-12-26 22:03:12,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:12,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88436620] [2019-12-26 22:03:12,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:12,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:03:12,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234284448] [2019-12-26 22:03:12,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:03:12,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:12,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:03:12,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:03:12,199 INFO L87 Difference]: Start difference. First operand 31894 states and 98893 transitions. Second operand 9 states. [2019-12-26 22:03:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:14,217 INFO L93 Difference]: Finished difference Result 56457 states and 170240 transitions. [2019-12-26 22:03:14,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:03:14,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-26 22:03:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:14,305 INFO L225 Difference]: With dead ends: 56457 [2019-12-26 22:03:14,305 INFO L226 Difference]: Without dead ends: 56182 [2019-12-26 22:03:14,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:03:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56182 states. [2019-12-26 22:03:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56182 to 36158. [2019-12-26 22:03:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36158 states. [2019-12-26 22:03:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36158 states to 36158 states and 111656 transitions. [2019-12-26 22:03:15,736 INFO L78 Accepts]: Start accepts. Automaton has 36158 states and 111656 transitions. Word has length 63 [2019-12-26 22:03:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:15,737 INFO L462 AbstractCegarLoop]: Abstraction has 36158 states and 111656 transitions. [2019-12-26 22:03:15,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:03:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 36158 states and 111656 transitions. [2019-12-26 22:03:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:03:15,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:15,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] [2019-12-26 22:03:15,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-26 22:03:15,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash 908177687, now seen corresponding path program 6 times [2019-12-26 22:03:15,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:15,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117088044] [2019-12-26 22:03:15,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:15,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117088044] [2019-12-26 22:03:15,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:15,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:03:15,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234373527] [2019-12-26 22:03:15,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:03:15,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:15,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:03:15,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:03:15,905 INFO L87 Difference]: Start difference. First operand 36158 states and 111656 transitions. Second operand 6 states. [2019-12-26 22:03:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:16,716 INFO L93 Difference]: Finished difference Result 59755 states and 182200 transitions. [2019-12-26 22:03:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:03:16,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-26 22:03:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:16,810 INFO L225 Difference]: With dead ends: 59755 [2019-12-26 22:03:16,811 INFO L226 Difference]: Without dead ends: 59535 [2019-12-26 22:03:16,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:03:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59535 states. [2019-12-26 22:03:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59535 to 40523. [2019-12-26 22:03:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40523 states. [2019-12-26 22:03:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40523 states to 40523 states and 125072 transitions. [2019-12-26 22:03:17,610 INFO L78 Accepts]: Start accepts. Automaton has 40523 states and 125072 transitions. Word has length 63 [2019-12-26 22:03:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:17,610 INFO L462 AbstractCegarLoop]: Abstraction has 40523 states and 125072 transitions. [2019-12-26 22:03:17,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:03:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 40523 states and 125072 transitions. [2019-12-26 22:03:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:03:17,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:17,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:17,657 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:17,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1577046585, now seen corresponding path program 7 times [2019-12-26 22:03:17,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:17,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085652180] [2019-12-26 22:03:17,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:17,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085652180] [2019-12-26 22:03:17,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:17,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:03:17,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155002085] [2019-12-26 22:03:17,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:03:17,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:17,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:03:17,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:03:17,772 INFO L87 Difference]: Start difference. First operand 40523 states and 125072 transitions. Second operand 7 states. [2019-12-26 22:03:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:19,251 INFO L93 Difference]: Finished difference Result 61173 states and 186174 transitions. [2019-12-26 22:03:19,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:03:19,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:03:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:19,345 INFO L225 Difference]: With dead ends: 61173 [2019-12-26 22:03:19,346 INFO L226 Difference]: Without dead ends: 60921 [2019-12-26 22:03:19,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:03:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60921 states. [2019-12-26 22:03:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60921 to 41432. [2019-12-26 22:03:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41432 states. [2019-12-26 22:03:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41432 states to 41432 states and 127729 transitions. [2019-12-26 22:03:20,757 INFO L78 Accepts]: Start accepts. Automaton has 41432 states and 127729 transitions. Word has length 63 [2019-12-26 22:03:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:20,757 INFO L462 AbstractCegarLoop]: Abstraction has 41432 states and 127729 transitions. [2019-12-26 22:03:20,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:03:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 41432 states and 127729 transitions. [2019-12-26 22:03:20,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:03:20,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:20,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:20,809 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:20,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:20,809 INFO L82 PathProgramCache]: Analyzing trace with hash 593914995, now seen corresponding path program 8 times [2019-12-26 22:03:20,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:20,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049035352] [2019-12-26 22:03:20,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:20,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049035352] [2019-12-26 22:03:20,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:20,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:03:20,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493688720] [2019-12-26 22:03:20,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:03:20,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:03:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:03:20,873 INFO L87 Difference]: Start difference. First operand 41432 states and 127729 transitions. Second operand 3 states. [2019-12-26 22:03:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:21,055 INFO L93 Difference]: Finished difference Result 41431 states and 127727 transitions. [2019-12-26 22:03:21,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:03:21,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-26 22:03:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:21,151 INFO L225 Difference]: With dead ends: 41431 [2019-12-26 22:03:21,151 INFO L226 Difference]: Without dead ends: 41431 [2019-12-26 22:03:21,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:03:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41431 states. [2019-12-26 22:03:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41431 to 33909. [2019-12-26 22:03:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33909 states. [2019-12-26 22:03:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33909 states to 33909 states and 105743 transitions. [2019-12-26 22:03:21,803 INFO L78 Accepts]: Start accepts. Automaton has 33909 states and 105743 transitions. Word has length 63 [2019-12-26 22:03:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:21,804 INFO L462 AbstractCegarLoop]: Abstraction has 33909 states and 105743 transitions. [2019-12-26 22:03:21,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:03:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 33909 states and 105743 transitions. [2019-12-26 22:03:21,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:03:21,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:21,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:21,845 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:21,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:21,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-26 22:03:21,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:21,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609134474] [2019-12-26 22:03:21,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:21,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609134474] [2019-12-26 22:03:21,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:21,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:03:21,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188230180] [2019-12-26 22:03:21,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:03:21,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:21,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:03:21,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:03:21,909 INFO L87 Difference]: Start difference. First operand 33909 states and 105743 transitions. Second operand 3 states. [2019-12-26 22:03:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:22,019 INFO L93 Difference]: Finished difference Result 25837 states and 79829 transitions. [2019-12-26 22:03:22,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:03:22,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:03:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:22,056 INFO L225 Difference]: With dead ends: 25837 [2019-12-26 22:03:22,056 INFO L226 Difference]: Without dead ends: 25837 [2019-12-26 22:03:22,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:03:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25837 states. [2019-12-26 22:03:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25837 to 23681. [2019-12-26 22:03:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23681 states. [2019-12-26 22:03:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23681 states to 23681 states and 73087 transitions. [2019-12-26 22:03:22,930 INFO L78 Accepts]: Start accepts. Automaton has 23681 states and 73087 transitions. Word has length 64 [2019-12-26 22:03:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:22,930 INFO L462 AbstractCegarLoop]: Abstraction has 23681 states and 73087 transitions. [2019-12-26 22:03:22,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:03:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 23681 states and 73087 transitions. [2019-12-26 22:03:22,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:03:22,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:22,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:22,956 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash -668679299, now seen corresponding path program 1 times [2019-12-26 22:03:22,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:22,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778656752] [2019-12-26 22:03:22,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:23,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778656752] [2019-12-26 22:03:23,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:23,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:03:23,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798705599] [2019-12-26 22:03:23,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:03:23,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:23,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:03:23,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:03:23,049 INFO L87 Difference]: Start difference. First operand 23681 states and 73087 transitions. Second operand 6 states. [2019-12-26 22:03:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:23,871 INFO L93 Difference]: Finished difference Result 32680 states and 99444 transitions. [2019-12-26 22:03:23,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:03:23,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 22:03:23,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:23,920 INFO L225 Difference]: With dead ends: 32680 [2019-12-26 22:03:23,920 INFO L226 Difference]: Without dead ends: 32680 [2019-12-26 22:03:23,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:03:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32680 states. [2019-12-26 22:03:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32680 to 25472. [2019-12-26 22:03:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25472 states. [2019-12-26 22:03:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25472 states to 25472 states and 78487 transitions. [2019-12-26 22:03:24,371 INFO L78 Accepts]: Start accepts. Automaton has 25472 states and 78487 transitions. Word has length 65 [2019-12-26 22:03:24,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:24,371 INFO L462 AbstractCegarLoop]: Abstraction has 25472 states and 78487 transitions. [2019-12-26 22:03:24,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:03:24,371 INFO L276 IsEmpty]: Start isEmpty. Operand 25472 states and 78487 transitions. [2019-12-26 22:03:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:03:24,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:24,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:24,399 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:24,399 INFO L82 PathProgramCache]: Analyzing trace with hash 339295601, now seen corresponding path program 2 times [2019-12-26 22:03:24,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:24,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304642323] [2019-12-26 22:03:24,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:24,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304642323] [2019-12-26 22:03:24,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:24,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:03:24,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507619477] [2019-12-26 22:03:24,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:03:24,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:24,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:03:24,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:03:24,594 INFO L87 Difference]: Start difference. First operand 25472 states and 78487 transitions. Second operand 11 states. [2019-12-26 22:03:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:25,949 INFO L93 Difference]: Finished difference Result 55172 states and 170404 transitions. [2019-12-26 22:03:25,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 22:03:25,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 22:03:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:26,033 INFO L225 Difference]: With dead ends: 55172 [2019-12-26 22:03:26,033 INFO L226 Difference]: Without dead ends: 52618 [2019-12-26 22:03:26,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-26 22:03:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52618 states. [2019-12-26 22:03:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52618 to 30915. [2019-12-26 22:03:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-26 22:03:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 95124 transitions. [2019-12-26 22:03:27,237 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 95124 transitions. Word has length 65 [2019-12-26 22:03:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:27,237 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 95124 transitions. [2019-12-26 22:03:27,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:03:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 95124 transitions. [2019-12-26 22:03:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:03:27,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:27,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:27,278 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:27,278 INFO L82 PathProgramCache]: Analyzing trace with hash 51203325, now seen corresponding path program 3 times [2019-12-26 22:03:27,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:27,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129109186] [2019-12-26 22:03:27,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:27,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129109186] [2019-12-26 22:03:27,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:27,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:03:27,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278657781] [2019-12-26 22:03:27,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:03:27,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:27,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:03:27,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:03:27,427 INFO L87 Difference]: Start difference. First operand 30915 states and 95124 transitions. Second operand 11 states. [2019-12-26 22:03:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:28,615 INFO L93 Difference]: Finished difference Result 53434 states and 163645 transitions. [2019-12-26 22:03:28,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:03:28,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 22:03:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:28,681 INFO L225 Difference]: With dead ends: 53434 [2019-12-26 22:03:28,681 INFO L226 Difference]: Without dead ends: 43177 [2019-12-26 22:03:28,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:03:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43177 states. [2019-12-26 22:03:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43177 to 25347. [2019-12-26 22:03:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25347 states. [2019-12-26 22:03:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25347 states to 25347 states and 77448 transitions. [2019-12-26 22:03:29,211 INFO L78 Accepts]: Start accepts. Automaton has 25347 states and 77448 transitions. Word has length 65 [2019-12-26 22:03:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:29,211 INFO L462 AbstractCegarLoop]: Abstraction has 25347 states and 77448 transitions. [2019-12-26 22:03:29,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:03:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 25347 states and 77448 transitions. [2019-12-26 22:03:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:03:29,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:29,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:29,242 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:29,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1186487875, now seen corresponding path program 4 times [2019-12-26 22:03:29,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:29,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192079009] [2019-12-26 22:03:29,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:29,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192079009] [2019-12-26 22:03:29,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:29,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 22:03:29,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203167174] [2019-12-26 22:03:29,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 22:03:29,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:29,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 22:03:29,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:03:29,804 INFO L87 Difference]: Start difference. First operand 25347 states and 77448 transitions. Second operand 18 states. [2019-12-26 22:03:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:33,010 INFO L93 Difference]: Finished difference Result 33235 states and 100285 transitions. [2019-12-26 22:03:33,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-26 22:03:33,011 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-12-26 22:03:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:33,059 INFO L225 Difference]: With dead ends: 33235 [2019-12-26 22:03:33,059 INFO L226 Difference]: Without dead ends: 32514 [2019-12-26 22:03:33,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=337, Invalid=1469, Unknown=0, NotChecked=0, Total=1806 [2019-12-26 22:03:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32514 states. [2019-12-26 22:03:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32514 to 25263. [2019-12-26 22:03:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25263 states. [2019-12-26 22:03:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25263 states to 25263 states and 77226 transitions. [2019-12-26 22:03:33,484 INFO L78 Accepts]: Start accepts. Automaton has 25263 states and 77226 transitions. Word has length 65 [2019-12-26 22:03:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:33,484 INFO L462 AbstractCegarLoop]: Abstraction has 25263 states and 77226 transitions. [2019-12-26 22:03:33,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 22:03:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 25263 states and 77226 transitions. [2019-12-26 22:03:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:03:33,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:33,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:33,512 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-26 22:03:33,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:33,512 INFO L82 PathProgramCache]: Analyzing trace with hash 106608093, now seen corresponding path program 5 times [2019-12-26 22:03:33,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:33,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677306821] [2019-12-26 22:03:33,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:33,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-26 22:03:33,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677306821] [2019-12-26 22:03:33,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:33,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:03:33,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254603563] [2019-12-26 22:03:33,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:03:33,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:33,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:03:33,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:03:33,636 INFO L87 Difference]: Start difference. First operand 25263 states and 77226 transitions. Second operand 9 states. [2019-12-26 22:03:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:35,751 INFO L93 Difference]: Finished difference Result 38209 states and 114827 transitions. [2019-12-26 22:03:35,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:03:35,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:03:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:35,813 INFO L225 Difference]: With dead ends: 38209 [2019-12-26 22:03:35,814 INFO L226 Difference]: Without dead ends: 38209 [2019-12-26 22:03:35,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:03:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38209 states. [2019-12-26 22:03:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38209 to 25023. [2019-12-26 22:03:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25023 states. [2019-12-26 22:03:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25023 states to 25023 states and 76618 transitions. [2019-12-26 22:03:36,320 INFO L78 Accepts]: Start accepts. Automaton has 25023 states and 76618 transitions. Word has length 65 [2019-12-26 22:03:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:36,321 INFO L462 AbstractCegarLoop]: Abstraction has 25023 states and 76618 transitions. [2019-12-26 22:03:36,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:03:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 25023 states and 76618 transitions. [2019-12-26 22:03:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:03:36,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:36,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:36,348 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-26 22:03:36,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:36,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1664741459, now seen corresponding path program 6 times [2019-12-26 22:03:36,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:36,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083427522] [2019-12-26 22:03:36,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:36,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083427522] [2019-12-26 22:03:36,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:36,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:03:36,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81528155] [2019-12-26 22:03:36,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:03:36,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:36,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:03:36,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:03:36,518 INFO L87 Difference]: Start difference. First operand 25023 states and 76618 transitions. Second operand 11 states. [2019-12-26 22:03:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:38,158 INFO L93 Difference]: Finished difference Result 29201 states and 88632 transitions. [2019-12-26 22:03:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 22:03:38,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 22:03:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:38,214 INFO L225 Difference]: With dead ends: 29201 [2019-12-26 22:03:38,214 INFO L226 Difference]: Without dead ends: 28311 [2019-12-26 22:03:38,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:03:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28311 states. [2019-12-26 22:03:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28311 to 24623. [2019-12-26 22:03:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24623 states. [2019-12-26 22:03:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24623 states to 24623 states and 75467 transitions. [2019-12-26 22:03:38,625 INFO L78 Accepts]: Start accepts. Automaton has 24623 states and 75467 transitions. Word has length 65 [2019-12-26 22:03:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:38,626 INFO L462 AbstractCegarLoop]: Abstraction has 24623 states and 75467 transitions. [2019-12-26 22:03:38,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:03:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 24623 states and 75467 transitions. [2019-12-26 22:03:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:03:38,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:38,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:38,656 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-26 22:03:38,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:38,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1019867375, now seen corresponding path program 7 times [2019-12-26 22:03:38,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:38,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821688927] [2019-12-26 22:03:38,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:38,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:38,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821688927] [2019-12-26 22:03:38,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:38,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:03:38,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233640170] [2019-12-26 22:03:38,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:03:38,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:38,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:03:38,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:03:38,759 INFO L87 Difference]: Start difference. First operand 24623 states and 75467 transitions. Second operand 4 states. [2019-12-26 22:03:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:39,018 INFO L93 Difference]: Finished difference Result 29394 states and 89828 transitions. [2019-12-26 22:03:39,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:03:39,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:03:39,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:39,093 INFO L225 Difference]: With dead ends: 29394 [2019-12-26 22:03:39,093 INFO L226 Difference]: Without dead ends: 29394 [2019-12-26 22:03:39,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:03:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29394 states. [2019-12-26 22:03:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29394 to 24729. [2019-12-26 22:03:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24729 states. [2019-12-26 22:03:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24729 states to 24729 states and 76032 transitions. [2019-12-26 22:03:39,759 INFO L78 Accepts]: Start accepts. Automaton has 24729 states and 76032 transitions. Word has length 65 [2019-12-26 22:03:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:39,759 INFO L462 AbstractCegarLoop]: Abstraction has 24729 states and 76032 transitions. [2019-12-26 22:03:39,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:03:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 24729 states and 76032 transitions. [2019-12-26 22:03:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:03:39,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:39,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:39,790 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-26 22:03:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2033523235, now seen corresponding path program 1 times [2019-12-26 22:03:39,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:39,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908230818] [2019-12-26 22:03:39,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:03:39,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908230818] [2019-12-26 22:03:39,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:39,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:03:39,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891803768] [2019-12-26 22:03:39,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:03:39,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:39,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:03:39,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:03:39,937 INFO L87 Difference]: Start difference. First operand 24729 states and 76032 transitions. Second operand 11 states. [2019-12-26 22:03:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:41,161 INFO L93 Difference]: Finished difference Result 29860 states and 91067 transitions. [2019-12-26 22:03:41,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:03:41,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 22:03:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:41,208 INFO L225 Difference]: With dead ends: 29860 [2019-12-26 22:03:41,208 INFO L226 Difference]: Without dead ends: 29469 [2019-12-26 22:03:41,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:03:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29469 states. [2019-12-26 22:03:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29469 to 24545. [2019-12-26 22:03:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24545 states. [2019-12-26 22:03:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24545 states to 24545 states and 75566 transitions. [2019-12-26 22:03:42,234 INFO L78 Accepts]: Start accepts. Automaton has 24545 states and 75566 transitions. Word has length 66 [2019-12-26 22:03:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:42,234 INFO L462 AbstractCegarLoop]: Abstraction has 24545 states and 75566 transitions. [2019-12-26 22:03:42,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:03:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 24545 states and 75566 transitions. [2019-12-26 22:03:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:03:42,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:42,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:42,263 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-26 22:03:42,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:42,263 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 2 times [2019-12-26 22:03:42,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:42,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094095329] [2019-12-26 22:03:42,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:03:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:03:42,406 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:03:42,406 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:03:42,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t678~0.base_22|) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t678~0.base_22|) |v_ULTIMATE.start_main_~#t678~0.offset_16| 0))) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t678~0.base_22| 1) |v_#valid_69|) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t678~0.base_22| 4)) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= (select .cse0 |v_ULTIMATE.start_main_~#t678~0.base_22|) 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= 0 |v_ULTIMATE.start_main_~#t678~0.offset_16|) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t678~0.offset=|v_ULTIMATE.start_main_~#t678~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ULTIMATE.start_main_~#t678~0.base=|v_ULTIMATE.start_main_~#t678~0.base_22|, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t678~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t680~0.offset, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t680~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t679~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t678~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:03:42,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:03:42,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (not (= |v_ULTIMATE.start_main_~#t679~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t679~0.base_11|) |v_ULTIMATE.start_main_~#t679~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t679~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t679~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t679~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t679~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t679~0.base=|v_ULTIMATE.start_main_~#t679~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t679~0.offset=|v_ULTIMATE.start_main_~#t679~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t679~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t679~0.offset] because there is no mapped edge [2019-12-26 22:03:42,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t680~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t680~0.base_12| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t680~0.base_12|) |v_ULTIMATE.start_main_~#t680~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t680~0.base_12|) (= |v_ULTIMATE.start_main_~#t680~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t680~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t680~0.offset=|v_ULTIMATE.start_main_~#t680~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t680~0.base=|v_ULTIMATE.start_main_~#t680~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t680~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t680~0.base] because there is no mapped edge [2019-12-26 22:03:42,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1312013069 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1312013069 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out-1312013069| |P1Thread1of1ForFork2_#t~ite9_Out-1312013069|))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1312013069| ~z$w_buff1~0_In-1312013069) .cse2) (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out-1312013069| ~z~0_In-1312013069)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1312013069, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1312013069, ~z$w_buff1~0=~z$w_buff1~0_In-1312013069, ~z~0=~z~0_In-1312013069} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1312013069|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1312013069, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1312013069|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1312013069, ~z$w_buff1~0=~z$w_buff1~0_In-1312013069, ~z~0=~z~0_In-1312013069} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 22:03:42,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In172130274 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out172130274| ~z$w_buff1~0_In172130274) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In172130274 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In172130274 256))) (= 0 (mod ~z$w_buff0_used~0_In172130274 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In172130274 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite24_Out172130274| |P2Thread1of1ForFork0_#t~ite23_Out172130274|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite24_Out172130274| ~z$w_buff1~0_In172130274) (= |P2Thread1of1ForFork0_#t~ite23_In172130274| |P2Thread1of1ForFork0_#t~ite23_Out172130274|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In172130274, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In172130274, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In172130274|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In172130274, ~z$w_buff1~0=~z$w_buff1~0_In172130274, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In172130274, ~weak$$choice2~0=~weak$$choice2~0_In172130274} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In172130274, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out172130274|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In172130274, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out172130274|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In172130274, ~z$w_buff1~0=~z$w_buff1~0_In172130274, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In172130274, ~weak$$choice2~0=~weak$$choice2~0_In172130274} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 22:03:42,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-451368670 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In-451368670 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-451368670 256))) (.cse4 (= (mod ~z$w_buff0_used~0_In-451368670 256) 0)) (.cse5 (= |P2Thread1of1ForFork0_#t~ite29_Out-451368670| |P2Thread1of1ForFork0_#t~ite30_Out-451368670|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-451368670 256)))) (or (let ((.cse1 (not .cse6))) (and .cse0 (or .cse1 (not .cse2)) (or (not .cse3) .cse1) (not .cse4) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-451368670|) (= |P2Thread1of1ForFork0_#t~ite29_Out-451368670| |P2Thread1of1ForFork0_#t~ite28_Out-451368670|) .cse5)) (and (= |P2Thread1of1ForFork0_#t~ite28_In-451368670| |P2Thread1of1ForFork0_#t~ite28_Out-451368670|) (or (and (or (and .cse6 .cse2) (and .cse6 .cse3) .cse4) .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-451368670| ~z$w_buff1_used~0_In-451368670) .cse5) (and (not .cse0) (= ~z$w_buff1_used~0_In-451368670 |P2Thread1of1ForFork0_#t~ite30_Out-451368670|) (= |P2Thread1of1ForFork0_#t~ite29_Out-451368670| |P2Thread1of1ForFork0_#t~ite29_In-451368670|)))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-451368670|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-451368670, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-451368670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-451368670, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-451368670, ~weak$$choice2~0=~weak$$choice2~0_In-451368670, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-451368670|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-451368670|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-451368670, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-451368670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-451368670, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-451368670, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-451368670|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-451368670|, ~weak$$choice2~0=~weak$$choice2~0_In-451368670} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 22:03:42,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 22:03:42,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 22:03:42,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In998153640 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In998153640 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out998153640| |P2Thread1of1ForFork0_#t~ite38_Out998153640|))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out998153640| ~z$w_buff1~0_In998153640) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out998153640| ~z~0_In998153640)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In998153640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In998153640, ~z$w_buff1~0=~z$w_buff1~0_In998153640, ~z~0=~z~0_In998153640} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out998153640|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out998153640|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In998153640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In998153640, ~z$w_buff1~0=~z$w_buff1~0_In998153640, ~z~0=~z~0_In998153640} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:03:42,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2005172558 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2005172558 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out2005172558|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In2005172558 |P2Thread1of1ForFork0_#t~ite40_Out2005172558|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2005172558, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2005172558} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2005172558, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out2005172558|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2005172558} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 22:03:42,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1531533742 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1531533742 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1531533742 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1531533742 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1531533742|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1531533742 |P2Thread1of1ForFork0_#t~ite41_Out1531533742|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1531533742, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1531533742, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531533742, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1531533742} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1531533742, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1531533742, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531533742, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1531533742, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1531533742|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 22:03:42,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-434300008 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-434300008 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-434300008| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-434300008| ~z$r_buff0_thd3~0_In-434300008)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-434300008, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-434300008} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-434300008, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-434300008, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-434300008|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 22:03:42,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1525700322 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1525700322 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1525700322 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1525700322 256)))) (or (and (= ~z$r_buff1_thd3~0_In1525700322 |P2Thread1of1ForFork0_#t~ite43_Out1525700322|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1525700322|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1525700322, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1525700322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1525700322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1525700322} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1525700322|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1525700322, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1525700322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1525700322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1525700322} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 22:03:42,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 22:03:42,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In310797707 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In310797707 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out310797707|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In310797707 |P0Thread1of1ForFork1_#t~ite5_Out310797707|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In310797707, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In310797707} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out310797707|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In310797707, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In310797707} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 22:03:42,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-633106512 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-633106512 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-633106512 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-633106512 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-633106512 |P0Thread1of1ForFork1_#t~ite6_Out-633106512|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-633106512|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-633106512, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-633106512, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-633106512, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-633106512} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-633106512, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-633106512|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-633106512, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-633106512, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-633106512} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 22:03:42,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1473043913 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1473043913 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out-1473043913) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1473043913 ~z$r_buff0_thd1~0_Out-1473043913)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1473043913, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1473043913} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1473043913, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1473043913|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1473043913} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:03:42,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-2084584228 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2084584228 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-2084584228 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2084584228 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-2084584228|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-2084584228 |P0Thread1of1ForFork1_#t~ite8_Out-2084584228|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2084584228, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2084584228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2084584228, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2084584228} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-2084584228|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2084584228, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2084584228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2084584228, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2084584228} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:03:42,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:03:42,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-77179902 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-77179902 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-77179902| ~z$w_buff0_used~0_In-77179902) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-77179902| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-77179902, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-77179902} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-77179902, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-77179902|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-77179902} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:03:42,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1712148126 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1712148126 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1712148126 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1712148126 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1712148126| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out-1712148126| ~z$w_buff1_used~0_In-1712148126)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1712148126, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1712148126, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1712148126, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1712148126} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1712148126, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1712148126, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1712148126, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1712148126|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1712148126} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 22:03:42,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In998323406 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In998323406 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In998323406 |P1Thread1of1ForFork2_#t~ite13_Out998323406|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out998323406| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In998323406, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In998323406} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In998323406, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out998323406|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In998323406} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 22:03:42,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1487841888 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1487841888 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1487841888 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-1487841888 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1487841888| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1487841888| ~z$r_buff1_thd2~0_In-1487841888) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487841888, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1487841888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1487841888, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1487841888} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487841888, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1487841888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1487841888, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1487841888|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1487841888} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 22:03:42,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 22:03:42,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:03:42,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1147618263 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1147618263 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1147618263| ~z~0_In1147618263) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out1147618263| ~z$w_buff1~0_In1147618263) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1147618263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1147618263, ~z$w_buff1~0=~z$w_buff1~0_In1147618263, ~z~0=~z~0_In1147618263} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1147618263, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1147618263|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1147618263, ~z$w_buff1~0=~z$w_buff1~0_In1147618263, ~z~0=~z~0_In1147618263} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 22:03:42,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-26 22:03:42,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-616644468 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-616644468 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-616644468|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-616644468 |ULTIMATE.start_main_#t~ite49_Out-616644468|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-616644468, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-616644468} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-616644468, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-616644468, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-616644468|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:03:42,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2100730564 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2100730564 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-2100730564 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2100730564 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-2100730564| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-2100730564 |ULTIMATE.start_main_#t~ite50_Out-2100730564|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2100730564, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100730564, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2100730564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2100730564} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2100730564|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2100730564, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100730564, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2100730564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2100730564} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:03:42,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In2139381170 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2139381170 256)))) (or (and (= ~z$r_buff0_thd0~0_In2139381170 |ULTIMATE.start_main_#t~ite51_Out2139381170|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out2139381170|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2139381170, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2139381170} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2139381170, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2139381170|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2139381170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:03:42,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In876796992 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In876796992 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In876796992 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In876796992 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out876796992| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In876796992 |ULTIMATE.start_main_#t~ite52_Out876796992|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In876796992, ~z$w_buff0_used~0=~z$w_buff0_used~0_In876796992, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In876796992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In876796992} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out876796992|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In876796992, ~z$w_buff0_used~0=~z$w_buff0_used~0_In876796992, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In876796992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In876796992} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:03:42,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:03:42,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:03:42 BasicIcfg [2019-12-26 22:03:42,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:03:42,554 INFO L168 Benchmark]: Toolchain (without parser) took 129495.26 ms. Allocated memory was 137.4 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 100.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-26 22:03:42,555 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 22:03:42,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.14 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 155.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:03:42,555 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.19 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:03:42,556 INFO L168 Benchmark]: Boogie Preprocessor took 49.52 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:03:42,556 INFO L168 Benchmark]: RCFGBuilder took 830.87 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 100.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:03:42,556 INFO L168 Benchmark]: TraceAbstraction took 127794.26 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 99.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-26 22:03:42,559 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.50 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.14 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 155.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.19 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.52 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.87 ms. Allocated memory is still 201.9 MB. Free memory was 150.3 MB in the beginning and 100.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 127794.26 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 99.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t678, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t679, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t680, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 127.4s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 38.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8343 SDtfs, 9468 SDslu, 26885 SDs, 0 SdLazy, 15934 SolverSat, 388 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 71 SyntacticMatches, 24 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 54.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 320006 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1538 NumberOfCodeBlocks, 1538 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1439 ConstructedInterpolants, 0 QuantifiedInterpolants, 304687 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...