/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:50:17,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:50:17,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:50:17,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:50:17,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:50:17,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:50:17,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:50:17,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:50:17,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:50:17,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:50:17,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:50:17,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:50:17,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:50:17,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:50:17,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:50:17,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:50:17,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:50:17,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:50:17,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:50:17,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:50:17,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:50:17,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:50:17,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:50:17,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:50:17,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:50:17,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:50:17,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:50:17,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:50:17,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:50:17,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:50:17,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:50:17,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:50:17,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:50:17,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:50:17,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:50:17,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:50:17,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:50:17,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:50:17,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:50:17,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:50:17,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:50:17,892 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:50:17,906 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:50:17,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:50:17,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:50:17,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:50:17,910 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:50:17,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:50:17,910 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:50:17,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:50:17,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:50:17,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:50:17,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:50:17,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:50:17,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:50:17,912 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:50:17,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:50:17,912 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:50:17,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:50:17,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:50:17,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:50:17,914 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:50:17,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:50:17,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:50:17,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:50:17,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:50:17,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:50:17,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:50:17,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:50:17,916 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:50:17,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:50:17,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:50:18,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:50:18,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:50:18,209 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:50:18,210 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:50:18,211 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:50:18,212 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2019-12-27 05:50:18,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1364cc111/3edc1861eb5846758e5b92f9ea5e4ab7/FLAG07bf9a44c [2019-12-27 05:50:18,804 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:50:18,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2019-12-27 05:50:18,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1364cc111/3edc1861eb5846758e5b92f9ea5e4ab7/FLAG07bf9a44c [2019-12-27 05:50:19,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1364cc111/3edc1861eb5846758e5b92f9ea5e4ab7 [2019-12-27 05:50:19,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:50:19,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:50:19,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:50:19,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:50:19,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:50:19,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:50:19" (1/1) ... [2019-12-27 05:50:19,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61be2d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19, skipping insertion in model container [2019-12-27 05:50:19,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:50:19" (1/1) ... [2019-12-27 05:50:19,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:50:19,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:50:19,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:50:19,795 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:50:19,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:50:19,963 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:50:19,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19 WrapperNode [2019-12-27 05:50:19,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:50:19,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:50:19,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:50:19,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:50:19,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19" (1/1) ... [2019-12-27 05:50:20,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19" (1/1) ... [2019-12-27 05:50:20,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:50:20,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:50:20,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:50:20,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:50:20,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19" (1/1) ... [2019-12-27 05:50:20,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19" (1/1) ... [2019-12-27 05:50:20,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19" (1/1) ... [2019-12-27 05:50:20,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19" (1/1) ... [2019-12-27 05:50:20,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19" (1/1) ... [2019-12-27 05:50:20,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19" (1/1) ... [2019-12-27 05:50:20,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19" (1/1) ... [2019-12-27 05:50:20,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:50:20,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:50:20,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:50:20,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:50:20,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:50:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:50:20,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:50:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:50:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:50:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:50:20,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:50:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:50:20,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:50:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:50:20,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:50:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:50:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:50:20,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:50:20,156 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:50:20,917 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:50:20,917 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:50:20,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:50:20 BoogieIcfgContainer [2019-12-27 05:50:20,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:50:20,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:50:20,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:50:20,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:50:20,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:50:19" (1/3) ... [2019-12-27 05:50:20,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d101e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:50:20, skipping insertion in model container [2019-12-27 05:50:20,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:19" (2/3) ... [2019-12-27 05:50:20,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d101e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:50:20, skipping insertion in model container [2019-12-27 05:50:20,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:50:20" (3/3) ... [2019-12-27 05:50:20,927 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_power.opt.i [2019-12-27 05:50:20,938 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:50:20,938 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:50:20,949 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:50:20,950 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:50:20,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:20,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:20,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:20,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:20,999 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:20,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:20,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:20,999 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,050 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,050 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,050 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,050 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,051 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,069 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,070 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,080 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,083 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,091 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,091 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,092 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:50:21,113 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:50:21,129 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:50:21,130 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:50:21,130 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:50:21,130 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:50:21,130 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:50:21,130 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:50:21,130 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:50:21,130 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:50:21,146 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 05:50:21,147 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 05:50:21,246 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 05:50:21,246 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:50:21,262 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 05:50:21,284 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 05:50:21,365 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 05:50:21,365 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:50:21,379 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 05:50:21,397 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 05:50:21,398 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:50:25,241 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 05:50:25,381 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 05:50:25,398 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75401 [2019-12-27 05:50:25,399 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 05:50:25,402 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-27 05:50:35,772 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-27 05:50:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-27 05:50:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 05:50:35,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:50:35,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 05:50:35,781 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:50:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:50:35,787 INFO L82 PathProgramCache]: Analyzing trace with hash 802091485, now seen corresponding path program 1 times [2019-12-27 05:50:35,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:50:35,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589604235] [2019-12-27 05:50:35,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:50:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:50:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:50:36,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589604235] [2019-12-27 05:50:36,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:50:36,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:50:36,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117503129] [2019-12-27 05:50:36,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:50:36,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:50:36,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:50:36,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:50:36,056 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-27 05:50:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:50:37,392 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-27 05:50:37,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:50:37,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 05:50:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:50:40,102 INFO L225 Difference]: With dead ends: 81762 [2019-12-27 05:50:40,105 INFO L226 Difference]: Without dead ends: 77082 [2019-12-27 05:50:40,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:50:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-27 05:50:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-27 05:50:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-27 05:50:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-27 05:50:46,933 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-27 05:50:46,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:50:46,934 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-27 05:50:46,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:50:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-27 05:50:46,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:50:46,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:50:46,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:50:46,943 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:50:46,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:50:46,944 INFO L82 PathProgramCache]: Analyzing trace with hash 786856193, now seen corresponding path program 1 times [2019-12-27 05:50:46,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:50:46,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768083654] [2019-12-27 05:50:46,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:50:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:50:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:50:47,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768083654] [2019-12-27 05:50:47,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:50:47,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:50:47,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908898223] [2019-12-27 05:50:47,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:50:47,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:50:47,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:50:47,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:50:47,016 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-27 05:50:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:50:47,298 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-27 05:50:47,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:50:47,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:50:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:50:47,447 INFO L225 Difference]: With dead ends: 20478 [2019-12-27 05:50:47,448 INFO L226 Difference]: Without dead ends: 20478 [2019-12-27 05:50:47,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:50:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-27 05:50:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-27 05:50:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 05:50:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-27 05:50:50,553 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-27 05:50:50,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:50:50,553 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-27 05:50:50,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:50:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-27 05:50:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:50:50,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:50:50,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:50:50,555 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:50:50,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:50:50,556 INFO L82 PathProgramCache]: Analyzing trace with hash 721716162, now seen corresponding path program 1 times [2019-12-27 05:50:50,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:50:50,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008076592] [2019-12-27 05:50:50,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:50:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:50:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:50:50,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008076592] [2019-12-27 05:50:50,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:50:50,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:50:50,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394174251] [2019-12-27 05:50:50,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:50:50,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:50:50,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:50:50,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:50:50,648 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-27 05:50:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:50:50,983 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-27 05:50:50,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:50:50,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 05:50:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:50:51,206 INFO L225 Difference]: With dead ends: 30802 [2019-12-27 05:50:51,206 INFO L226 Difference]: Without dead ends: 30788 [2019-12-27 05:50:51,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:50:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-27 05:50:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-27 05:50:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 05:50:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-27 05:50:52,387 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-27 05:50:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:50:52,387 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-27 05:50:52,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:50:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-27 05:50:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:50:52,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:50:52,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:50:52,389 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:50:52,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:50:52,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1406835797, now seen corresponding path program 1 times [2019-12-27 05:50:52,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:50:52,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686971697] [2019-12-27 05:50:52,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:50:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:50:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:50:52,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686971697] [2019-12-27 05:50:52,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:50:52,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:50:52,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20798773] [2019-12-27 05:50:52,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:50:52,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:50:52,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:50:52,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:50:52,498 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-27 05:50:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:50:52,817 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-27 05:50:52,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:50:52,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 05:50:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:50:52,902 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 05:50:52,902 INFO L226 Difference]: Without dead ends: 35512 [2019-12-27 05:50:52,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:50:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-27 05:50:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-27 05:50:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-27 05:50:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-27 05:50:53,741 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-27 05:50:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:50:53,743 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-27 05:50:53,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:50:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-27 05:50:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:50:53,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:50:53,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:50:53,746 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:50:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:50:53,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1406985682, now seen corresponding path program 1 times [2019-12-27 05:50:53,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:50:53,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635939292] [2019-12-27 05:50:53,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:50:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:50:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:50:53,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635939292] [2019-12-27 05:50:53,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:50:53,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:50:53,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862302806] [2019-12-27 05:50:53,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:50:53,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:50:53,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:50:53,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:50:53,806 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-27 05:50:54,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:50:54,413 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-27 05:50:54,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:50:54,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 05:50:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:50:54,477 INFO L225 Difference]: With dead ends: 38443 [2019-12-27 05:50:54,477 INFO L226 Difference]: Without dead ends: 38432 [2019-12-27 05:50:54,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:50:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-27 05:50:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-27 05:50:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-27 05:50:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-27 05:50:55,060 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-27 05:50:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:50:55,060 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-27 05:50:55,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:50:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-27 05:50:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:50:55,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:50:55,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:50:55,070 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:50:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:50:55,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1124752400, now seen corresponding path program 1 times [2019-12-27 05:50:55,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:50:55,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563763265] [2019-12-27 05:50:55,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:50:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:50:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:50:55,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563763265] [2019-12-27 05:50:55,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:50:55,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:50:55,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81166581] [2019-12-27 05:50:55,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:50:55,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:50:55,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:50:55,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:50:55,219 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-27 05:50:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:50:55,808 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-27 05:50:55,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:50:55,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:50:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:50:56,219 INFO L225 Difference]: With dead ends: 45281 [2019-12-27 05:50:56,219 INFO L226 Difference]: Without dead ends: 45258 [2019-12-27 05:50:56,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:50:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-27 05:50:56,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-27 05:50:56,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-27 05:50:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-27 05:50:56,871 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-27 05:50:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:50:56,871 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-27 05:50:56,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:50:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-27 05:50:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:50:56,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:50:56,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:50:56,882 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:50:56,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:50:56,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1124902285, now seen corresponding path program 1 times [2019-12-27 05:50:56,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:50:56,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025543800] [2019-12-27 05:50:56,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:50:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:50:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:50:56,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025543800] [2019-12-27 05:50:56,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:50:56,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:50:56,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644429711] [2019-12-27 05:50:56,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:50:56,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:50:56,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:50:56,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:50:56,970 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-27 05:50:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:50:57,514 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-27 05:50:57,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:50:57,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:50:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:50:57,587 INFO L225 Difference]: With dead ends: 46044 [2019-12-27 05:50:57,587 INFO L226 Difference]: Without dead ends: 46021 [2019-12-27 05:50:57,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:50:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-27 05:50:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-27 05:50:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-27 05:50:58,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-27 05:50:58,513 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-27 05:50:58,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:50:58,513 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-27 05:50:58,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:50:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-27 05:50:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:50:58,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:50:58,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:50:58,523 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:50:58,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:50:58,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1835763287, now seen corresponding path program 1 times [2019-12-27 05:50:58,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:50:58,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952085880] [2019-12-27 05:50:58,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:50:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:50:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:50:58,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952085880] [2019-12-27 05:50:58,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:50:58,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:50:58,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157110989] [2019-12-27 05:50:58,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:50:58,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:50:58,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:50:58,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:50:58,567 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-27 05:50:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:50:58,626 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-27 05:50:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:50:58,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:50:58,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:50:58,645 INFO L225 Difference]: With dead ends: 11657 [2019-12-27 05:50:58,645 INFO L226 Difference]: Without dead ends: 11657 [2019-12-27 05:50:58,645 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-27 05:50:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-27 05:50:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-27 05:50:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-27 05:50:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-27 05:50:58,801 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-27 05:50:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:50:58,801 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-27 05:50:58,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:50:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-27 05:50:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:50:58,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:50:58,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:50:58,816 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:50:58,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:50:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash -786800782, now seen corresponding path program 1 times [2019-12-27 05:50:58,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:50:58,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799390380] [2019-12-27 05:50:58,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:50:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:50:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:50:58,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799390380] [2019-12-27 05:50:58,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:50:58,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:50:58,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988308761] [2019-12-27 05:50:58,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:50:58,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:50:58,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:50:58,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:50:58,879 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-27 05:50:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:50:58,927 INFO L93 Difference]: Finished difference Result 11488 states and 35391 transitions. [2019-12-27 05:50:58,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:50:58,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:50:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:50:58,950 INFO L225 Difference]: With dead ends: 11488 [2019-12-27 05:50:58,950 INFO L226 Difference]: Without dead ends: 11488 [2019-12-27 05:50:58,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:50:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11488 states. [2019-12-27 05:50:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11488 to 11488. [2019-12-27 05:50:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11488 states. [2019-12-27 05:50:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 35391 transitions. [2019-12-27 05:50:59,231 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 35391 transitions. Word has length 39 [2019-12-27 05:50:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:50:59,232 INFO L462 AbstractCegarLoop]: Abstraction has 11488 states and 35391 transitions. [2019-12-27 05:50:59,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:50:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 35391 transitions. [2019-12-27 05:50:59,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:50:59,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:50:59,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:50:59,258 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:50:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:50:59,258 INFO L82 PathProgramCache]: Analyzing trace with hash -153890988, now seen corresponding path program 1 times [2019-12-27 05:50:59,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:50:59,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666698245] [2019-12-27 05:50:59,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:50:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:50:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:50:59,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666698245] [2019-12-27 05:50:59,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:50:59,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:50:59,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323852175] [2019-12-27 05:50:59,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:50:59,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:50:59,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:50:59,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:50:59,344 INFO L87 Difference]: Start difference. First operand 11488 states and 35391 transitions. Second operand 5 states. [2019-12-27 05:50:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:50:59,423 INFO L93 Difference]: Finished difference Result 10239 states and 32168 transitions. [2019-12-27 05:50:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:50:59,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:50:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:50:59,446 INFO L225 Difference]: With dead ends: 10239 [2019-12-27 05:50:59,446 INFO L226 Difference]: Without dead ends: 10239 [2019-12-27 05:50:59,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:50:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10239 states. [2019-12-27 05:50:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10239 to 9735. [2019-12-27 05:50:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9735 states. [2019-12-27 05:50:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9735 states to 9735 states and 30758 transitions. [2019-12-27 05:50:59,790 INFO L78 Accepts]: Start accepts. Automaton has 9735 states and 30758 transitions. Word has length 40 [2019-12-27 05:50:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:50:59,790 INFO L462 AbstractCegarLoop]: Abstraction has 9735 states and 30758 transitions. [2019-12-27 05:50:59,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:50:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 9735 states and 30758 transitions. [2019-12-27 05:50:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:50:59,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:50:59,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:50:59,805 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:50:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:50:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash 766293347, now seen corresponding path program 1 times [2019-12-27 05:50:59,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:50:59,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864242513] [2019-12-27 05:50:59,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:50:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:50:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:50:59,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864242513] [2019-12-27 05:50:59,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:50:59,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:50:59,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133291777] [2019-12-27 05:50:59,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:50:59,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:50:59,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:50:59,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:50:59,891 INFO L87 Difference]: Start difference. First operand 9735 states and 30758 transitions. Second operand 3 states. [2019-12-27 05:50:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:50:59,958 INFO L93 Difference]: Finished difference Result 12683 states and 39352 transitions. [2019-12-27 05:50:59,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:50:59,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 05:50:59,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:50:59,976 INFO L225 Difference]: With dead ends: 12683 [2019-12-27 05:50:59,976 INFO L226 Difference]: Without dead ends: 12683 [2019-12-27 05:50:59,977 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-27 05:51:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12683 states. [2019-12-27 05:51:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12683 to 10393. [2019-12-27 05:51:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-27 05:51:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-27 05:51:00,152 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 54 [2019-12-27 05:51:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:00,152 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-27 05:51:00,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:51:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-27 05:51:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:51:00,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:00,168 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] [2019-12-27 05:51:00,168 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2104708736, now seen corresponding path program 1 times [2019-12-27 05:51:00,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:00,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236563470] [2019-12-27 05:51:00,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:00,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236563470] [2019-12-27 05:51:00,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:00,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:51:00,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325221763] [2019-12-27 05:51:00,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:51:00,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:00,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:51:00,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:51:00,264 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 7 states. [2019-12-27 05:51:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:00,696 INFO L93 Difference]: Finished difference Result 26623 states and 83594 transitions. [2019-12-27 05:51:00,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:51:00,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 05:51:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:00,738 INFO L225 Difference]: With dead ends: 26623 [2019-12-27 05:51:00,739 INFO L226 Difference]: Without dead ends: 20927 [2019-12-27 05:51:00,739 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-27 05:51:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20927 states. [2019-12-27 05:51:01,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20927 to 13189. [2019-12-27 05:51:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13189 states. [2019-12-27 05:51:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13189 states to 13189 states and 41908 transitions. [2019-12-27 05:51:01,029 INFO L78 Accepts]: Start accepts. Automaton has 13189 states and 41908 transitions. Word has length 54 [2019-12-27 05:51:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:01,029 INFO L462 AbstractCegarLoop]: Abstraction has 13189 states and 41908 transitions. [2019-12-27 05:51:01,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:51:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 13189 states and 41908 transitions. [2019-12-27 05:51:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:51:01,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:01,049 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] [2019-12-27 05:51:01,049 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:01,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:01,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1580720394, now seen corresponding path program 2 times [2019-12-27 05:51:01,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:01,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291787721] [2019-12-27 05:51:01,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:01,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291787721] [2019-12-27 05:51:01,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:01,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:51:01,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803024920] [2019-12-27 05:51:01,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:51:01,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:01,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:51:01,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:51:01,142 INFO L87 Difference]: Start difference. First operand 13189 states and 41908 transitions. Second operand 7 states. [2019-12-27 05:51:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:01,604 INFO L93 Difference]: Finished difference Result 34316 states and 106692 transitions. [2019-12-27 05:51:01,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:51:01,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 05:51:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:01,981 INFO L225 Difference]: With dead ends: 34316 [2019-12-27 05:51:01,981 INFO L226 Difference]: Without dead ends: 25449 [2019-12-27 05:51:01,982 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-27 05:51:02,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25449 states. [2019-12-27 05:51:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25449 to 17200. [2019-12-27 05:51:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17200 states. [2019-12-27 05:51:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17200 states to 17200 states and 54622 transitions. [2019-12-27 05:51:02,494 INFO L78 Accepts]: Start accepts. Automaton has 17200 states and 54622 transitions. Word has length 54 [2019-12-27 05:51:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:02,495 INFO L462 AbstractCegarLoop]: Abstraction has 17200 states and 54622 transitions. [2019-12-27 05:51:02,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:51:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 17200 states and 54622 transitions. [2019-12-27 05:51:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:51:02,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:02,530 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] [2019-12-27 05:51:02,531 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash 714355520, now seen corresponding path program 3 times [2019-12-27 05:51:02,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:02,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148953015] [2019-12-27 05:51:02,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:02,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148953015] [2019-12-27 05:51:02,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:02,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:51:02,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315982944] [2019-12-27 05:51:02,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:51:02,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:02,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:51:02,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:51:02,659 INFO L87 Difference]: Start difference. First operand 17200 states and 54622 transitions. Second operand 9 states. [2019-12-27 05:51:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:04,336 INFO L93 Difference]: Finished difference Result 89167 states and 277833 transitions. [2019-12-27 05:51:04,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 05:51:04,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 05:51:04,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:04,474 INFO L225 Difference]: With dead ends: 89167 [2019-12-27 05:51:04,474 INFO L226 Difference]: Without dead ends: 76971 [2019-12-27 05:51:04,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 05:51:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76971 states. [2019-12-27 05:51:05,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76971 to 23213. [2019-12-27 05:51:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23213 states. [2019-12-27 05:51:05,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23213 states to 23213 states and 74466 transitions. [2019-12-27 05:51:05,661 INFO L78 Accepts]: Start accepts. Automaton has 23213 states and 74466 transitions. Word has length 54 [2019-12-27 05:51:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:05,661 INFO L462 AbstractCegarLoop]: Abstraction has 23213 states and 74466 transitions. [2019-12-27 05:51:05,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:51:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 23213 states and 74466 transitions. [2019-12-27 05:51:05,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:51:05,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:05,698 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] [2019-12-27 05:51:05,698 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:05,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:05,698 INFO L82 PathProgramCache]: Analyzing trace with hash 265762130, now seen corresponding path program 4 times [2019-12-27 05:51:05,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:05,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946205128] [2019-12-27 05:51:05,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:05,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946205128] [2019-12-27 05:51:05,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:05,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:51:05,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674250815] [2019-12-27 05:51:05,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:51:05,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:05,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:51:05,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:51:05,812 INFO L87 Difference]: Start difference. First operand 23213 states and 74466 transitions. Second operand 9 states. [2019-12-27 05:51:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:07,309 INFO L93 Difference]: Finished difference Result 69362 states and 216514 transitions. [2019-12-27 05:51:07,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 05:51:07,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 05:51:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:07,409 INFO L225 Difference]: With dead ends: 69362 [2019-12-27 05:51:07,410 INFO L226 Difference]: Without dead ends: 66294 [2019-12-27 05:51:07,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 05:51:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66294 states. [2019-12-27 05:51:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66294 to 22741. [2019-12-27 05:51:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22741 states. [2019-12-27 05:51:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22741 states to 22741 states and 73038 transitions. [2019-12-27 05:51:08,426 INFO L78 Accepts]: Start accepts. Automaton has 22741 states and 73038 transitions. Word has length 54 [2019-12-27 05:51:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:08,426 INFO L462 AbstractCegarLoop]: Abstraction has 22741 states and 73038 transitions. [2019-12-27 05:51:08,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:51:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 22741 states and 73038 transitions. [2019-12-27 05:51:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 05:51:08,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:08,459 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] [2019-12-27 05:51:08,459 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:08,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2030886808, now seen corresponding path program 5 times [2019-12-27 05:51:08,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:08,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863737640] [2019-12-27 05:51:08,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:08,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863737640] [2019-12-27 05:51:08,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:08,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:51:08,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505303140] [2019-12-27 05:51:08,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:51:08,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:08,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:51:08,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:51:08,579 INFO L87 Difference]: Start difference. First operand 22741 states and 73038 transitions. Second operand 3 states. [2019-12-27 05:51:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:08,670 INFO L93 Difference]: Finished difference Result 22739 states and 73033 transitions. [2019-12-27 05:51:08,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:51:08,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 05:51:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:08,704 INFO L225 Difference]: With dead ends: 22739 [2019-12-27 05:51:08,704 INFO L226 Difference]: Without dead ends: 22739 [2019-12-27 05:51:08,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:51:08,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22739 states. [2019-12-27 05:51:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22739 to 21096. [2019-12-27 05:51:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21096 states. [2019-12-27 05:51:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21096 states to 21096 states and 68535 transitions. [2019-12-27 05:51:09,019 INFO L78 Accepts]: Start accepts. Automaton has 21096 states and 68535 transitions. Word has length 54 [2019-12-27 05:51:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:09,019 INFO L462 AbstractCegarLoop]: Abstraction has 21096 states and 68535 transitions. [2019-12-27 05:51:09,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:51:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 21096 states and 68535 transitions. [2019-12-27 05:51:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 05:51:09,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:09,041 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] [2019-12-27 05:51:09,042 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:09,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1896131244, now seen corresponding path program 1 times [2019-12-27 05:51:09,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:09,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697098343] [2019-12-27 05:51:09,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:09,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697098343] [2019-12-27 05:51:09,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:09,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:51:09,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812406117] [2019-12-27 05:51:09,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:51:09,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:51:09,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:51:09,107 INFO L87 Difference]: Start difference. First operand 21096 states and 68535 transitions. Second operand 3 states. [2019-12-27 05:51:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:09,188 INFO L93 Difference]: Finished difference Result 19398 states and 61782 transitions. [2019-12-27 05:51:09,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:51:09,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 05:51:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:09,218 INFO L225 Difference]: With dead ends: 19398 [2019-12-27 05:51:09,218 INFO L226 Difference]: Without dead ends: 19398 [2019-12-27 05:51:09,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:51:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19398 states. [2019-12-27 05:51:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19398 to 16534. [2019-12-27 05:51:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16534 states. [2019-12-27 05:51:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16534 states to 16534 states and 52346 transitions. [2019-12-27 05:51:09,465 INFO L78 Accepts]: Start accepts. Automaton has 16534 states and 52346 transitions. Word has length 55 [2019-12-27 05:51:09,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:09,465 INFO L462 AbstractCegarLoop]: Abstraction has 16534 states and 52346 transitions. [2019-12-27 05:51:09,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:51:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 16534 states and 52346 transitions. [2019-12-27 05:51:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:51:09,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:09,482 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] [2019-12-27 05:51:09,483 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1578077188, now seen corresponding path program 1 times [2019-12-27 05:51:09,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:09,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240061745] [2019-12-27 05:51:09,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:09,804 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-27 05:51:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:09,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240061745] [2019-12-27 05:51:09,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:09,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:51:09,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565731669] [2019-12-27 05:51:09,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:51:09,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:09,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:51:09,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:51:09,870 INFO L87 Difference]: Start difference. First operand 16534 states and 52346 transitions. Second operand 9 states. [2019-12-27 05:51:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:11,216 INFO L93 Difference]: Finished difference Result 29391 states and 92467 transitions. [2019-12-27 05:51:11,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:51:11,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 05:51:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:11,256 INFO L225 Difference]: With dead ends: 29391 [2019-12-27 05:51:11,256 INFO L226 Difference]: Without dead ends: 24775 [2019-12-27 05:51:11,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:51:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24775 states. [2019-12-27 05:51:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24775 to 17142. [2019-12-27 05:51:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17142 states. [2019-12-27 05:51:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17142 states to 17142 states and 54026 transitions. [2019-12-27 05:51:11,585 INFO L78 Accepts]: Start accepts. Automaton has 17142 states and 54026 transitions. Word has length 56 [2019-12-27 05:51:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:11,585 INFO L462 AbstractCegarLoop]: Abstraction has 17142 states and 54026 transitions. [2019-12-27 05:51:11,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:51:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 17142 states and 54026 transitions. [2019-12-27 05:51:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:51:11,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:11,606 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] [2019-12-27 05:51:11,606 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:11,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1760958284, now seen corresponding path program 2 times [2019-12-27 05:51:11,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:11,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588638919] [2019-12-27 05:51:11,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:11,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588638919] [2019-12-27 05:51:11,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:11,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 05:51:11,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37740786] [2019-12-27 05:51:11,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 05:51:11,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:11,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 05:51:11,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:51:11,948 INFO L87 Difference]: Start difference. First operand 17142 states and 54026 transitions. Second operand 14 states. [2019-12-27 05:51:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:15,372 INFO L93 Difference]: Finished difference Result 27730 states and 85638 transitions. [2019-12-27 05:51:15,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 05:51:15,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 05:51:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:15,409 INFO L225 Difference]: With dead ends: 27730 [2019-12-27 05:51:15,409 INFO L226 Difference]: Without dead ends: 25350 [2019-12-27 05:51:15,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=1353, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 05:51:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25350 states. [2019-12-27 05:51:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25350 to 18807. [2019-12-27 05:51:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18807 states. [2019-12-27 05:51:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 58699 transitions. [2019-12-27 05:51:15,708 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 58699 transitions. Word has length 56 [2019-12-27 05:51:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:15,708 INFO L462 AbstractCegarLoop]: Abstraction has 18807 states and 58699 transitions. [2019-12-27 05:51:15,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 05:51:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 58699 transitions. [2019-12-27 05:51:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:51:15,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:15,734 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] [2019-12-27 05:51:15,734 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:15,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1830147234, now seen corresponding path program 3 times [2019-12-27 05:51:15,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:15,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357987638] [2019-12-27 05:51:15,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:16,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357987638] [2019-12-27 05:51:16,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:16,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 05:51:16,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173922703] [2019-12-27 05:51:16,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 05:51:16,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:16,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 05:51:16,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:51:16,148 INFO L87 Difference]: Start difference. First operand 18807 states and 58699 transitions. Second operand 15 states. [2019-12-27 05:51:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:20,312 INFO L93 Difference]: Finished difference Result 38653 states and 118821 transitions. [2019-12-27 05:51:20,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 05:51:20,313 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 05:51:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:20,370 INFO L225 Difference]: With dead ends: 38653 [2019-12-27 05:51:20,370 INFO L226 Difference]: Without dead ends: 37967 [2019-12-27 05:51:20,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=603, Invalid=3557, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 05:51:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37967 states. [2019-12-27 05:51:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37967 to 21671. [2019-12-27 05:51:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21671 states. [2019-12-27 05:51:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21671 states to 21671 states and 67444 transitions. [2019-12-27 05:51:21,039 INFO L78 Accepts]: Start accepts. Automaton has 21671 states and 67444 transitions. Word has length 56 [2019-12-27 05:51:21,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:21,039 INFO L462 AbstractCegarLoop]: Abstraction has 21671 states and 67444 transitions. [2019-12-27 05:51:21,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 05:51:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 21671 states and 67444 transitions. [2019-12-27 05:51:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:51:21,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:21,062 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] [2019-12-27 05:51:21,062 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash 457193928, now seen corresponding path program 4 times [2019-12-27 05:51:21,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:21,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875134560] [2019-12-27 05:51:21,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:21,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875134560] [2019-12-27 05:51:21,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:21,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 05:51:21,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092133480] [2019-12-27 05:51:21,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 05:51:21,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:21,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 05:51:21,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:51:21,466 INFO L87 Difference]: Start difference. First operand 21671 states and 67444 transitions. Second operand 15 states. [2019-12-27 05:51:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:26,089 INFO L93 Difference]: Finished difference Result 38135 states and 116878 transitions. [2019-12-27 05:51:26,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 05:51:26,090 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 05:51:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:26,137 INFO L225 Difference]: With dead ends: 38135 [2019-12-27 05:51:26,138 INFO L226 Difference]: Without dead ends: 31501 [2019-12-27 05:51:26,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=514, Invalid=2456, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 05:51:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31501 states. [2019-12-27 05:51:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31501 to 18543. [2019-12-27 05:51:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18543 states. [2019-12-27 05:51:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18543 states to 18543 states and 57663 transitions. [2019-12-27 05:51:26,764 INFO L78 Accepts]: Start accepts. Automaton has 18543 states and 57663 transitions. Word has length 56 [2019-12-27 05:51:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:26,764 INFO L462 AbstractCegarLoop]: Abstraction has 18543 states and 57663 transitions. [2019-12-27 05:51:26,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 05:51:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 18543 states and 57663 transitions. [2019-12-27 05:51:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:51:26,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:26,785 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] [2019-12-27 05:51:26,785 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash 943954388, now seen corresponding path program 5 times [2019-12-27 05:51:26,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:26,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13091651] [2019-12-27 05:51:26,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:27,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13091651] [2019-12-27 05:51:27,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:27,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:51:27,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331960526] [2019-12-27 05:51:27,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 05:51:27,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 05:51:27,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:51:27,287 INFO L87 Difference]: Start difference. First operand 18543 states and 57663 transitions. Second operand 16 states. [2019-12-27 05:51:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:31,151 INFO L93 Difference]: Finished difference Result 32610 states and 100378 transitions. [2019-12-27 05:51:31,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 05:51:31,152 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 05:51:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:31,209 INFO L225 Difference]: With dead ends: 32610 [2019-12-27 05:51:31,209 INFO L226 Difference]: Without dead ends: 32372 [2019-12-27 05:51:31,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=418, Invalid=2338, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 05:51:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32372 states. [2019-12-27 05:51:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32372 to 19877. [2019-12-27 05:51:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19877 states. [2019-12-27 05:51:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19877 states to 19877 states and 61673 transitions. [2019-12-27 05:51:31,587 INFO L78 Accepts]: Start accepts. Automaton has 19877 states and 61673 transitions. Word has length 56 [2019-12-27 05:51:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:31,587 INFO L462 AbstractCegarLoop]: Abstraction has 19877 states and 61673 transitions. [2019-12-27 05:51:31,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 05:51:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 19877 states and 61673 transitions. [2019-12-27 05:51:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:51:31,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:51:31,609 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:31,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:31,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1063671746, now seen corresponding path program 6 times [2019-12-27 05:51:31,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:31,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151007944] [2019-12-27 05:51:31,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:32,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151007944] [2019-12-27 05:51:32,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:32,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 05:51:32,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079595684] [2019-12-27 05:51:32,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 05:51:32,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 05:51:32,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:51:32,404 INFO L87 Difference]: Start difference. First operand 19877 states and 61673 transitions. Second operand 17 states. [2019-12-27 05:51:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:37,049 INFO L93 Difference]: Finished difference Result 27085 states and 83085 transitions. [2019-12-27 05:51:37,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 05:51:37,050 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 05:51:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:37,092 INFO L225 Difference]: With dead ends: 27085 [2019-12-27 05:51:37,092 INFO L226 Difference]: Without dead ends: 26495 [2019-12-27 05:51:37,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=342, Invalid=1550, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 05:51:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26495 states. [2019-12-27 05:51:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26495 to 20017. [2019-12-27 05:51:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20017 states. [2019-12-27 05:51:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20017 states to 20017 states and 62050 transitions. [2019-12-27 05:51:37,452 INFO L78 Accepts]: Start accepts. Automaton has 20017 states and 62050 transitions. Word has length 56 [2019-12-27 05:51:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:37,452 INFO L462 AbstractCegarLoop]: Abstraction has 20017 states and 62050 transitions. [2019-12-27 05:51:37,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 05:51:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 20017 states and 62050 transitions. [2019-12-27 05:51:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:51:37,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:37,477 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] [2019-12-27 05:51:37,477 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:37,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:37,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1777476986, now seen corresponding path program 7 times [2019-12-27 05:51:37,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:37,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395523501] [2019-12-27 05:51:37,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:37,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395523501] [2019-12-27 05:51:37,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:37,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 05:51:37,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103381470] [2019-12-27 05:51:37,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 05:51:37,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 05:51:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-27 05:51:37,952 INFO L87 Difference]: Start difference. First operand 20017 states and 62050 transitions. Second operand 17 states. [2019-12-27 05:51:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:41,383 INFO L93 Difference]: Finished difference Result 27257 states and 83642 transitions. [2019-12-27 05:51:41,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 05:51:41,383 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 05:51:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:41,422 INFO L225 Difference]: With dead ends: 27257 [2019-12-27 05:51:41,423 INFO L226 Difference]: Without dead ends: 26619 [2019-12-27 05:51:41,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 05:51:41,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26619 states. [2019-12-27 05:51:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26619 to 20117. [2019-12-27 05:51:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20117 states. [2019-12-27 05:51:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20117 states to 20117 states and 62345 transitions. [2019-12-27 05:51:41,770 INFO L78 Accepts]: Start accepts. Automaton has 20117 states and 62345 transitions. Word has length 56 [2019-12-27 05:51:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:41,770 INFO L462 AbstractCegarLoop]: Abstraction has 20117 states and 62345 transitions. [2019-12-27 05:51:41,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 05:51:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 20117 states and 62345 transitions. [2019-12-27 05:51:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:51:41,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:41,794 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] [2019-12-27 05:51:41,794 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:41,795 INFO L82 PathProgramCache]: Analyzing trace with hash 128333004, now seen corresponding path program 8 times [2019-12-27 05:51:41,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:41,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993492311] [2019-12-27 05:51:41,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:42,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993492311] [2019-12-27 05:51:42,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:42,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 05:51:42,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302827445] [2019-12-27 05:51:42,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 05:51:42,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:42,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 05:51:42,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:51:42,178 INFO L87 Difference]: Start difference. First operand 20117 states and 62345 transitions. Second operand 15 states. [2019-12-27 05:51:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:45,223 INFO L93 Difference]: Finished difference Result 32842 states and 100822 transitions. [2019-12-27 05:51:45,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 05:51:45,224 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 05:51:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:45,269 INFO L225 Difference]: With dead ends: 32842 [2019-12-27 05:51:45,269 INFO L226 Difference]: Without dead ends: 31144 [2019-12-27 05:51:45,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=403, Invalid=1853, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 05:51:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31144 states. [2019-12-27 05:51:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31144 to 18543. [2019-12-27 05:51:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18543 states. [2019-12-27 05:51:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18543 states to 18543 states and 57633 transitions. [2019-12-27 05:51:45,833 INFO L78 Accepts]: Start accepts. Automaton has 18543 states and 57633 transitions. Word has length 56 [2019-12-27 05:51:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:45,833 INFO L462 AbstractCegarLoop]: Abstraction has 18543 states and 57633 transitions. [2019-12-27 05:51:45,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 05:51:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 18543 states and 57633 transitions. [2019-12-27 05:51:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:51:45,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:45,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:51:45,854 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:45,854 INFO L82 PathProgramCache]: Analyzing trace with hash -301888144, now seen corresponding path program 9 times [2019-12-27 05:51:45,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:45,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742291783] [2019-12-27 05:51:45,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:46,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742291783] [2019-12-27 05:51:46,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:46,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:51:46,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878860283] [2019-12-27 05:51:46,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:51:46,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:46,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:51:46,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:51:46,037 INFO L87 Difference]: Start difference. First operand 18543 states and 57633 transitions. Second operand 11 states. [2019-12-27 05:51:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:46,989 INFO L93 Difference]: Finished difference Result 31205 states and 96699 transitions. [2019-12-27 05:51:46,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 05:51:46,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 05:51:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:47,034 INFO L225 Difference]: With dead ends: 31205 [2019-12-27 05:51:47,035 INFO L226 Difference]: Without dead ends: 30639 [2019-12-27 05:51:47,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-27 05:51:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30639 states. [2019-12-27 05:51:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30639 to 19621. [2019-12-27 05:51:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19621 states. [2019-12-27 05:51:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19621 states to 19621 states and 60945 transitions. [2019-12-27 05:51:47,430 INFO L78 Accepts]: Start accepts. Automaton has 19621 states and 60945 transitions. Word has length 56 [2019-12-27 05:51:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:47,431 INFO L462 AbstractCegarLoop]: Abstraction has 19621 states and 60945 transitions. [2019-12-27 05:51:47,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:51:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 19621 states and 60945 transitions. [2019-12-27 05:51:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:51:47,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:47,456 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] [2019-12-27 05:51:47,457 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1985453018, now seen corresponding path program 10 times [2019-12-27 05:51:47,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:47,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435796789] [2019-12-27 05:51:47,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:51:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:51:47,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435796789] [2019-12-27 05:51:47,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:51:47,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:51:47,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095890769] [2019-12-27 05:51:47,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:51:47,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:51:47,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:51:47,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:51:47,612 INFO L87 Difference]: Start difference. First operand 19621 states and 60945 transitions. Second operand 11 states. [2019-12-27 05:51:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:51:48,425 INFO L93 Difference]: Finished difference Result 30899 states and 95519 transitions. [2019-12-27 05:51:48,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:51:48,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 05:51:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:51:48,464 INFO L225 Difference]: With dead ends: 30899 [2019-12-27 05:51:48,464 INFO L226 Difference]: Without dead ends: 27263 [2019-12-27 05:51:48,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-27 05:51:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27263 states. [2019-12-27 05:51:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27263 to 17346. [2019-12-27 05:51:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17346 states. [2019-12-27 05:51:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17346 states to 17346 states and 54005 transitions. [2019-12-27 05:51:48,799 INFO L78 Accepts]: Start accepts. Automaton has 17346 states and 54005 transitions. Word has length 56 [2019-12-27 05:51:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:51:48,800 INFO L462 AbstractCegarLoop]: Abstraction has 17346 states and 54005 transitions. [2019-12-27 05:51:48,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:51:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 17346 states and 54005 transitions. [2019-12-27 05:51:48,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 05:51:48,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:51:48,820 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] [2019-12-27 05:51:48,820 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:51:48,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:51:48,821 INFO L82 PathProgramCache]: Analyzing trace with hash -826863496, now seen corresponding path program 11 times [2019-12-27 05:51:48,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:51:48,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886964687] [2019-12-27 05:51:48,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:51:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:51:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:51:49,163 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:51:49,163 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:51:49,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_41) (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~weak$$choice0~0_8) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t636~0.base_16| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t636~0.base_16|) |v_ULTIMATE.start_main_~#t636~0.offset_13| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff1_thd3~0_17) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~y$r_buff1_thd0~0_20) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$r_buff0_thd2~0_24 0) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd1~0_68 0) (= |v_ULTIMATE.start_main_~#t636~0.offset_13| 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t636~0.base_16|) (= v_~y$read_delayed~0_6 0) (= v_~z~0_15 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t636~0.base_16|) 0) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t636~0.base_16| 1)) (= v_~y$r_buff0_thd0~0_20 0) (= v_~a~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t636~0.base_16| 4)) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p0_EBX~0_14 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t638~0.offset=|v_ULTIMATE.start_main_~#t638~0.offset_15|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_10, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ULTIMATE.start_main_~#t638~0.base=|v_ULTIMATE.start_main_~#t638~0.base_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_68, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ULTIMATE.start_main_~#t636~0.offset=|v_ULTIMATE.start_main_~#t636~0.offset_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t637~0.offset=|v_ULTIMATE.start_main_~#t637~0.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_9, ULTIMATE.start_main_~#t636~0.base=|v_ULTIMATE.start_main_~#t636~0.base_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_34, ULTIMATE.start_main_~#t637~0.base=|v_ULTIMATE.start_main_~#t637~0.base_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_~#t638~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t638~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t636~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t637~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t636~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t637~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:51:49,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t637~0.base_11|) (= |v_ULTIMATE.start_main_~#t637~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t637~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t637~0.base_11|) |v_ULTIMATE.start_main_~#t637~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t637~0.base_11| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t637~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t637~0.base_11| 0)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t637~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t637~0.offset=|v_ULTIMATE.start_main_~#t637~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t637~0.base=|v_ULTIMATE.start_main_~#t637~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t637~0.offset, #length, ULTIMATE.start_main_~#t637~0.base] because there is no mapped edge [2019-12-27 05:51:49,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P1ENTRY-->L5-3: Formula: (and (= ~y$w_buff1~0_Out833530551 ~y$w_buff0~0_In833530551) (= ~y$w_buff1_used~0_Out833530551 ~y$w_buff0_used~0_In833530551) (= 1 ~y$w_buff0~0_Out833530551) (= ~y$w_buff0_used~0_Out833530551 1) (= (mod ~y$w_buff1_used~0_Out833530551 256) 0) (= P1Thread1of1ForFork1_~arg.offset_Out833530551 |P1Thread1of1ForFork1_#in~arg.offset_In833530551|) (= P1Thread1of1ForFork1_~arg.base_Out833530551 |P1Thread1of1ForFork1_#in~arg.base_In833530551|) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out833530551| 1) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out833530551| P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out833530551)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In833530551, ~y$w_buff0~0=~y$w_buff0~0_In833530551, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In833530551|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In833530551|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out833530551, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out833530551, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out833530551, ~y$w_buff1~0=~y$w_buff1~0_Out833530551, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out833530551|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out833530551, ~y$w_buff0~0=~y$w_buff0~0_Out833530551, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In833530551|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In833530551|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out833530551} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:51:49,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t638~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t638~0.base_11|)) (= |v_ULTIMATE.start_main_~#t638~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t638~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t638~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t638~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t638~0.base_11|) |v_ULTIMATE.start_main_~#t638~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t638~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t638~0.base=|v_ULTIMATE.start_main_~#t638~0.base_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t638~0.offset=|v_ULTIMATE.start_main_~#t638~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t638~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t638~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 05:51:49,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1261503688 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1261503688 256))) (.cse1 (= |P2Thread1of1ForFork2_#t~ite32_Out1261503688| |P2Thread1of1ForFork2_#t~ite33_Out1261503688|))) (or (and (= |P2Thread1of1ForFork2_#t~ite32_Out1261503688| ~y$w_buff1~0_In1261503688) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= ~y~0_In1261503688 |P2Thread1of1ForFork2_#t~ite32_Out1261503688|) .cse1))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1261503688, ~y$w_buff1~0=~y$w_buff1~0_In1261503688, ~y~0=~y~0_In1261503688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1261503688} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1261503688, ~y$w_buff1~0=~y$w_buff1~0_In1261503688, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out1261503688|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out1261503688|, ~y~0=~y~0_In1261503688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1261503688} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 05:51:49,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In181796780 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In181796780 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out181796780| ~y$w_buff0_used~0_In181796780)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out181796780| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In181796780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In181796780} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In181796780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In181796780, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out181796780|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 05:51:49,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In723185696 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In723185696 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite34_Out723185696| ~y$w_buff0_used~0_In723185696)) (and (= |P2Thread1of1ForFork2_#t~ite34_Out723185696| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In723185696, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In723185696} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out723185696|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In723185696, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In723185696} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 05:51:49,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1598370525 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1598370525 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1598370525 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1598370525 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite35_Out1598370525| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite35_Out1598370525| ~y$w_buff1_used~0_In1598370525)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1598370525, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1598370525, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1598370525, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1598370525} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out1598370525|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1598370525, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1598370525, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1598370525, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1598370525} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 05:51:49,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In942524688 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In942524688 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In942524688 |P2Thread1of1ForFork2_#t~ite36_Out942524688|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite36_Out942524688|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In942524688, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In942524688} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out942524688|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In942524688, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In942524688} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 05:51:49,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-1802607154 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1802607154 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1802607154 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1802607154 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite37_Out-1802607154| 0)) (and (= |P2Thread1of1ForFork2_#t~ite37_Out-1802607154| ~y$r_buff1_thd3~0_In-1802607154) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1802607154, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802607154, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1802607154, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1802607154} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-1802607154|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1802607154, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802607154, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1802607154, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1802607154} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 05:51:49,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~y$r_buff1_thd3~0_14)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 05:51:49,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-706685779 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-706685779 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-706685779 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-706685779 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-706685779|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-706685779 |P1Thread1of1ForFork1_#t~ite29_Out-706685779|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706685779, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706685779, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706685779, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706685779} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706685779, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-706685779|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706685779, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706685779, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706685779} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 05:51:49,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1659327963 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1659327963 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1659327963 ~y$r_buff0_thd2~0_Out1659327963)) (and (not .cse1) (= ~y$r_buff0_thd2~0_Out1659327963 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1659327963, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1659327963} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1659327963|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1659327963, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1659327963} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 05:51:49,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-1146856774 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1146856774 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1146856774 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1146856774 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1146856774| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1146856774| ~y$r_buff1_thd2~0_In-1146856774) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1146856774, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1146856774, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1146856774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1146856774} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1146856774, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1146856774, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1146856774|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1146856774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1146856774} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 05:51:49,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 05:51:49,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L750-->L750-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In960873448 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite9_Out960873448| ~y$w_buff0~0_In960873448) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite8_In960873448| |P0Thread1of1ForFork0_#t~ite8_Out960873448|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In960873448 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In960873448 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd1~0_In960873448 256) 0)) (= (mod ~y$w_buff0_used~0_In960873448 256) 0))) (= |P0Thread1of1ForFork0_#t~ite9_Out960873448| |P0Thread1of1ForFork0_#t~ite8_Out960873448|) (= |P0Thread1of1ForFork0_#t~ite8_Out960873448| ~y$w_buff0~0_In960873448)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In960873448, ~y$w_buff0_used~0=~y$w_buff0_used~0_In960873448, ~y$w_buff0~0=~y$w_buff0~0_In960873448, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In960873448, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In960873448|, ~weak$$choice2~0=~weak$$choice2~0_In960873448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In960873448} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In960873448, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out960873448|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In960873448, ~y$w_buff0~0=~y$w_buff0~0_In960873448, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out960873448|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In960873448, ~weak$$choice2~0=~weak$$choice2~0_In960873448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In960873448} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 05:51:49,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L751-->L751-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2056557611 256) 0))) (or (and (= ~y$w_buff1~0_In2056557611 |P0Thread1of1ForFork0_#t~ite11_Out2056557611|) (= |P0Thread1of1ForFork0_#t~ite12_Out2056557611| |P0Thread1of1ForFork0_#t~ite11_Out2056557611|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In2056557611 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In2056557611 256))) (= 0 (mod ~y$w_buff0_used~0_In2056557611 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In2056557611 256) 0))))) (and (= |P0Thread1of1ForFork0_#t~ite12_Out2056557611| ~y$w_buff1~0_In2056557611) (= |P0Thread1of1ForFork0_#t~ite11_In2056557611| |P0Thread1of1ForFork0_#t~ite11_Out2056557611|) (not .cse0)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In2056557611|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2056557611, ~y$w_buff1~0=~y$w_buff1~0_In2056557611, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2056557611, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2056557611, ~weak$$choice2~0=~weak$$choice2~0_In2056557611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2056557611} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out2056557611|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2056557611, ~y$w_buff1~0=~y$w_buff1~0_In2056557611, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2056557611, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2056557611, ~weak$$choice2~0=~weak$$choice2~0_In2056557611, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out2056557611|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2056557611} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 05:51:49,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L754-->L755: Formula: (and (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_50) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_8|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_10|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 05:51:49,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L755-->L755-8: Formula: (let ((.cse3 (= |P0Thread1of1ForFork0_#t~ite23_Out1568259203| |P0Thread1of1ForFork0_#t~ite24_Out1568259203|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1568259203 256))) (.cse6 (= (mod ~y$r_buff0_thd1~0_In1568259203 256) 0)) (.cse4 (= (mod ~y$r_buff1_thd1~0_In1568259203 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1568259203 256))) (.cse5 (= (mod ~weak$$choice2~0_In1568259203 256) 0))) (or (let ((.cse2 (not .cse6))) (and (= 0 |P0Thread1of1ForFork0_#t~ite22_Out1568259203|) (not .cse0) (or (not .cse1) .cse2) .cse3 (or (not .cse4) .cse2) (= |P0Thread1of1ForFork0_#t~ite23_Out1568259203| |P0Thread1of1ForFork0_#t~ite22_Out1568259203|) .cse5)) (and (= |P0Thread1of1ForFork0_#t~ite22_In1568259203| |P0Thread1of1ForFork0_#t~ite22_Out1568259203|) (or (and (= ~y$r_buff1_thd1~0_In1568259203 |P0Thread1of1ForFork0_#t~ite23_Out1568259203|) .cse3 (or (and .cse6 .cse1) (and .cse6 .cse4) .cse0) .cse5) (and (not .cse5) (= ~y$r_buff1_thd1~0_In1568259203 |P0Thread1of1ForFork0_#t~ite24_Out1568259203|) (= |P0Thread1of1ForFork0_#t~ite23_Out1568259203| |P0Thread1of1ForFork0_#t~ite23_In1568259203|)))))) InVars {P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_In1568259203|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1568259203, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1568259203, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1568259203, ~weak$$choice2~0=~weak$$choice2~0_In1568259203, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1568259203, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In1568259203|} OutVars{P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_Out1568259203|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1568259203, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1568259203, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1568259203, ~weak$$choice2~0=~weak$$choice2~0_In1568259203, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out1568259203|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out1568259203|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1568259203} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 05:51:49,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= v_~y~0_17 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 05:51:49,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:51:49,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1196129744 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1196129744 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1196129744 |ULTIMATE.start_main_#t~ite41_Out-1196129744|) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-1196129744 |ULTIMATE.start_main_#t~ite41_Out-1196129744|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1196129744, ~y~0=~y~0_In-1196129744, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1196129744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1196129744} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1196129744|, ~y$w_buff1~0=~y$w_buff1~0_In-1196129744, ~y~0=~y~0_In-1196129744, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1196129744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1196129744} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 05:51:49,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:51:49,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1327898439 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1327898439 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1327898439| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1327898439| ~y$w_buff0_used~0_In-1327898439)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1327898439, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1327898439} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1327898439, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1327898439, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1327898439|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 05:51:49,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1159434363 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1159434363 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1159434363 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1159434363 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1159434363| ~y$w_buff1_used~0_In1159434363) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out1159434363| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1159434363, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1159434363, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1159434363, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1159434363} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1159434363, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1159434363, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1159434363, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1159434363|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1159434363} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 05:51:49,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-75496881 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-75496881 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-75496881| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-75496881 |ULTIMATE.start_main_#t~ite45_Out-75496881|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-75496881, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-75496881} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-75496881, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-75496881, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-75496881|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 05:51:49,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1711229919 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1711229919 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1711229919 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1711229919 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-1711229919| 0)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1711229919| ~y$r_buff1_thd0~0_In-1711229919) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1711229919, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1711229919, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1711229919, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1711229919} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1711229919, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1711229919, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1711229919|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1711229919, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1711229919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 05:51:49,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_10 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite46_13| v_~y$r_buff1_thd0~0_14) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_~__unbuffered_p0_EAX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:51:49,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:51:49 BasicIcfg [2019-12-27 05:51:49,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:51:49,269 INFO L168 Benchmark]: Toolchain (without parser) took 90136.91 ms. Allocated memory was 138.9 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 100.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 776.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:51:49,270 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 05:51:49,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.14 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 155.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:51:49,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.41 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:51:49,272 INFO L168 Benchmark]: Boogie Preprocessor took 37.28 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:51:49,272 INFO L168 Benchmark]: RCFGBuilder took 844.60 ms. Allocated memory is still 202.9 MB. Free memory was 150.6 MB in the beginning and 103.3 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-12-27 05:51:49,273 INFO L168 Benchmark]: TraceAbstraction took 88347.48 ms. Allocated memory was 202.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 103.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 715.4 MB. Max. memory is 7.1 GB. [2019-12-27 05:51:49,277 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.74 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 828.14 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.6 MB in the beginning and 155.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.41 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.28 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 844.60 ms. Allocated memory is still 202.9 MB. Free memory was 150.6 MB in the beginning and 103.3 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88347.48 ms. Allocated memory was 202.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 103.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 715.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 6412 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75401 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.0s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 43.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6854 SDtfs, 11277 SDslu, 31223 SDs, 0 SdLazy, 27191 SolverSat, 610 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 32 SyntacticMatches, 32 SemanticMatches, 531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5706 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 267089 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1202 NumberOfCodeBlocks, 1202 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1119 ConstructedInterpolants, 0 QuantifiedInterpolants, 306003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...