/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:58:20,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:58:20,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:58:20,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:58:20,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:58:20,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:58:20,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:58:20,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:58:20,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:58:20,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:58:20,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:58:20,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:58:20,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:58:20,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:58:20,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:58:20,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:58:20,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:58:20,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:58:20,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:58:20,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:58:20,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:58:20,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:58:20,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:58:20,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:58:20,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:58:20,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:58:20,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:58:20,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:58:20,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:58:20,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:58:20,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:58:20,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:58:20,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:58:20,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:58:20,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:58:20,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:58:20,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:58:20,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:58:20,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:58:20,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:58:20,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:58:20,871 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-NoLbe.epf [2019-12-27 08:58:20,912 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:58:20,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:58:20,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:58:20,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:58:20,914 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:58:20,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:58:20,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:58:20,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:58:20,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:58:20,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:58:20,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:58:20,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:58:20,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:58:20,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:58:20,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:58:20,916 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:58:20,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:58:20,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:58:20,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:58:20,920 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:58:20,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:58:20,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:58:20,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:58:20,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:58:20,921 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:58:20,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:58:20,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:58:20,923 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 08:58:20,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:58:20,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:58:21,204 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:58:21,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:58:21,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:58:21,223 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:58:21,223 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:58:21,224 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_pso.opt.i [2019-12-27 08:58:21,300 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9b02a03/adc5914748474983afa1be3388d6b821/FLAG20069de48 [2019-12-27 08:58:21,904 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:58:21,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_pso.opt.i [2019-12-27 08:58:21,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9b02a03/adc5914748474983afa1be3388d6b821/FLAG20069de48 [2019-12-27 08:58:22,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9b02a03/adc5914748474983afa1be3388d6b821 [2019-12-27 08:58:22,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:58:22,135 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:58:22,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:58:22,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:58:22,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:58:22,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:58:22" (1/1) ... [2019-12-27 08:58:22,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a6e624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:22, skipping insertion in model container [2019-12-27 08:58:22,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:58:22" (1/1) ... [2019-12-27 08:58:22,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:58:22,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:58:22,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:58:22,840 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:58:22,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:58:23,009 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:58:23,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23 WrapperNode [2019-12-27 08:58:23,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:58:23,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:58:23,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:58:23,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:58:23,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23" (1/1) ... [2019-12-27 08:58:23,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23" (1/1) ... [2019-12-27 08:58:23,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:58:23,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:58:23,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:58:23,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:58:23,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23" (1/1) ... [2019-12-27 08:58:23,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23" (1/1) ... [2019-12-27 08:58:23,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23" (1/1) ... [2019-12-27 08:58:23,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23" (1/1) ... [2019-12-27 08:58:23,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23" (1/1) ... [2019-12-27 08:58:23,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23" (1/1) ... [2019-12-27 08:58:23,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23" (1/1) ... [2019-12-27 08:58:23,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:58:23,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:58:23,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:58:23,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:58:23,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23" (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 08:58:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:58:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:58:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:58:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:58:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:58:23,211 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:58:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:58:23,211 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:58:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:58:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:58:23,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:58:23,214 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 08:58:24,087 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:58:24,088 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:58:24,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:58:24 BoogieIcfgContainer [2019-12-27 08:58:24,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:58:24,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:58:24,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:58:24,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:58:24,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:58:22" (1/3) ... [2019-12-27 08:58:24,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f1d035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:58:24, skipping insertion in model container [2019-12-27 08:58:24,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:23" (2/3) ... [2019-12-27 08:58:24,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f1d035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:58:24, skipping insertion in model container [2019-12-27 08:58:24,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:58:24" (3/3) ... [2019-12-27 08:58:24,098 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_pso.opt.i [2019-12-27 08:58:24,108 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:58:24,108 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:58:24,116 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:58:24,116 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:58:24,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,181 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,182 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,220 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,220 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,220 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,220 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,221 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,252 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,261 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,262 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,264 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:58:24,280 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 08:58:24,301 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:58:24,302 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:58:24,302 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:58:24,302 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:58:24,302 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:58:24,302 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:58:24,302 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:58:24,302 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:58:24,316 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 179 places, 228 transitions [2019-12-27 08:58:32,293 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80073 states. [2019-12-27 08:58:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 80073 states. [2019-12-27 08:58:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 08:58:32,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:58:32,307 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 08:58:32,307 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:58:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:58:32,313 INFO L82 PathProgramCache]: Analyzing trace with hash -37838152, now seen corresponding path program 1 times [2019-12-27 08:58:32,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:58:32,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695523216] [2019-12-27 08:58:32,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:58:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:58:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:58:32,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695523216] [2019-12-27 08:58:32,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:58:32,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:58:32,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234958022] [2019-12-27 08:58:32,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:58:32,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:58:32,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:58:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:58:32,637 INFO L87 Difference]: Start difference. First operand 80073 states. Second operand 4 states. [2019-12-27 08:58:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:58:34,697 INFO L93 Difference]: Finished difference Result 80713 states and 324638 transitions. [2019-12-27 08:58:34,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:58:34,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 08:58:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:58:35,117 INFO L225 Difference]: With dead ends: 80713 [2019-12-27 08:58:35,118 INFO L226 Difference]: Without dead ends: 59001 [2019-12-27 08:58:35,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:58:37,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59001 states. [2019-12-27 08:58:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59001 to 59001. [2019-12-27 08:58:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59001 states. [2019-12-27 08:58:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59001 states to 59001 states and 240126 transitions. [2019-12-27 08:58:40,169 INFO L78 Accepts]: Start accepts. Automaton has 59001 states and 240126 transitions. Word has length 40 [2019-12-27 08:58:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:58:40,170 INFO L462 AbstractCegarLoop]: Abstraction has 59001 states and 240126 transitions. [2019-12-27 08:58:40,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:58:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 59001 states and 240126 transitions. [2019-12-27 08:58:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 08:58:40,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:58:40,185 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] [2019-12-27 08:58:40,186 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:58:40,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:58:40,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1935034616, now seen corresponding path program 1 times [2019-12-27 08:58:40,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:58:40,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113379441] [2019-12-27 08:58:40,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:58:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:58:40,364 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 08:58:40,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113379441] [2019-12-27 08:58:40,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:58:40,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:58:40,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361741029] [2019-12-27 08:58:40,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:58:40,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:58:40,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:58:40,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:58:40,369 INFO L87 Difference]: Start difference. First operand 59001 states and 240126 transitions. Second operand 5 states. [2019-12-27 08:58:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:58:43,503 INFO L93 Difference]: Finished difference Result 95595 states and 363717 transitions. [2019-12-27 08:58:43,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:58:43,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-27 08:58:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:58:43,901 INFO L225 Difference]: With dead ends: 95595 [2019-12-27 08:58:43,901 INFO L226 Difference]: Without dead ends: 95043 [2019-12-27 08:58:43,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:58:45,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95043 states. [2019-12-27 08:58:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95043 to 93165. [2019-12-27 08:58:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93165 states. [2019-12-27 08:58:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93165 states to 93165 states and 356303 transitions. [2019-12-27 08:58:49,929 INFO L78 Accepts]: Start accepts. Automaton has 93165 states and 356303 transitions. Word has length 48 [2019-12-27 08:58:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:58:49,931 INFO L462 AbstractCegarLoop]: Abstraction has 93165 states and 356303 transitions. [2019-12-27 08:58:49,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:58:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 93165 states and 356303 transitions. [2019-12-27 08:58:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 08:58:49,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:58:49,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:58:49,938 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:58:49,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:58:49,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1649757835, now seen corresponding path program 1 times [2019-12-27 08:58:49,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:58:49,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975977852] [2019-12-27 08:58:49,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:58:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:58:50,026 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 08:58:50,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975977852] [2019-12-27 08:58:50,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:58:50,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:58:50,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584468116] [2019-12-27 08:58:50,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:58:50,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:58:50,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:58:50,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:58:50,031 INFO L87 Difference]: Start difference. First operand 93165 states and 356303 transitions. Second operand 5 states. [2019-12-27 08:58:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:58:54,506 INFO L93 Difference]: Finished difference Result 118509 states and 442884 transitions. [2019-12-27 08:58:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:58:54,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-27 08:58:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:58:54,826 INFO L225 Difference]: With dead ends: 118509 [2019-12-27 08:58:54,826 INFO L226 Difference]: Without dead ends: 118061 [2019-12-27 08:58:54,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:58:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118061 states. [2019-12-27 08:58:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118061 to 104154. [2019-12-27 08:58:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104154 states. [2019-12-27 08:58:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104154 states to 104154 states and 394237 transitions. [2019-12-27 08:58:58,608 INFO L78 Accepts]: Start accepts. Automaton has 104154 states and 394237 transitions. Word has length 49 [2019-12-27 08:58:58,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:58:58,608 INFO L462 AbstractCegarLoop]: Abstraction has 104154 states and 394237 transitions. [2019-12-27 08:58:58,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:58:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 104154 states and 394237 transitions. [2019-12-27 08:58:58,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 08:58:58,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:58:58,619 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] [2019-12-27 08:58:58,619 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:58:58,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:58:58,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1457879985, now seen corresponding path program 1 times [2019-12-27 08:58:58,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:58:58,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755689770] [2019-12-27 08:58:58,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:58:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:58:58,677 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 08:58:58,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755689770] [2019-12-27 08:58:58,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:58:58,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:58:58,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003424783] [2019-12-27 08:58:58,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:58:58,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:58:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:58:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:58:58,680 INFO L87 Difference]: Start difference. First operand 104154 states and 394237 transitions. Second operand 3 states. [2019-12-27 08:58:59,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:58:59,483 INFO L93 Difference]: Finished difference Result 170912 states and 627059 transitions. [2019-12-27 08:58:59,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:58:59,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 08:58:59,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:59:04,415 INFO L225 Difference]: With dead ends: 170912 [2019-12-27 08:59:04,416 INFO L226 Difference]: Without dead ends: 170912 [2019-12-27 08:59:04,416 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 08:59:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170912 states. [2019-12-27 08:59:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170912 to 157190. [2019-12-27 08:59:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157190 states. [2019-12-27 08:59:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157190 states to 157190 states and 581291 transitions. [2019-12-27 08:59:09,921 INFO L78 Accepts]: Start accepts. Automaton has 157190 states and 581291 transitions. Word has length 51 [2019-12-27 08:59:09,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:59:09,921 INFO L462 AbstractCegarLoop]: Abstraction has 157190 states and 581291 transitions. [2019-12-27 08:59:09,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:59:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 157190 states and 581291 transitions. [2019-12-27 08:59:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:59:09,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:59:09,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:59:09,956 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:59:09,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:59:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash -98676228, now seen corresponding path program 1 times [2019-12-27 08:59:09,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:59:09,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740148213] [2019-12-27 08:59:09,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:59:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:59:10,073 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 08:59:10,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740148213] [2019-12-27 08:59:10,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:59:10,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:59:10,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508042779] [2019-12-27 08:59:10,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:59:10,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:59:10,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:59:10,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:59:10,076 INFO L87 Difference]: Start difference. First operand 157190 states and 581291 transitions. Second operand 6 states. [2019-12-27 08:59:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:59:12,641 INFO L93 Difference]: Finished difference Result 212574 states and 766173 transitions. [2019-12-27 08:59:12,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 08:59:12,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 08:59:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:59:14,448 INFO L225 Difference]: With dead ends: 212574 [2019-12-27 08:59:14,448 INFO L226 Difference]: Without dead ends: 212054 [2019-12-27 08:59:14,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:59:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212054 states. [2019-12-27 08:59:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212054 to 157972. [2019-12-27 08:59:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157972 states. [2019-12-27 08:59:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157972 states to 157972 states and 584228 transitions. [2019-12-27 08:59:26,049 INFO L78 Accepts]: Start accepts. Automaton has 157972 states and 584228 transitions. Word has length 55 [2019-12-27 08:59:26,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:59:26,049 INFO L462 AbstractCegarLoop]: Abstraction has 157972 states and 584228 transitions. [2019-12-27 08:59:26,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:59:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 157972 states and 584228 transitions. [2019-12-27 08:59:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:59:26,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:59:26,076 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 08:59:26,076 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:59:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:59:26,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1815293041, now seen corresponding path program 1 times [2019-12-27 08:59:26,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:59:26,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617951107] [2019-12-27 08:59:26,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:59:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:59:26,231 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 08:59:26,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617951107] [2019-12-27 08:59:26,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:59:26,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:59:26,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36155802] [2019-12-27 08:59:26,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:59:26,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:59:26,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:59:26,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:59:26,238 INFO L87 Difference]: Start difference. First operand 157972 states and 584228 transitions. Second operand 6 states. [2019-12-27 08:59:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:59:29,119 INFO L93 Difference]: Finished difference Result 208199 states and 766452 transitions. [2019-12-27 08:59:29,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:59:29,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 08:59:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:59:29,684 INFO L225 Difference]: With dead ends: 208199 [2019-12-27 08:59:29,684 INFO L226 Difference]: Without dead ends: 208199 [2019-12-27 08:59:29,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:59:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208199 states. [2019-12-27 08:59:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208199 to 193995. [2019-12-27 08:59:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193995 states. [2019-12-27 08:59:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193995 states to 193995 states and 714236 transitions. [2019-12-27 08:59:40,776 INFO L78 Accepts]: Start accepts. Automaton has 193995 states and 714236 transitions. Word has length 55 [2019-12-27 08:59:40,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:59:40,776 INFO L462 AbstractCegarLoop]: Abstraction has 193995 states and 714236 transitions. [2019-12-27 08:59:40,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:59:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 193995 states and 714236 transitions. [2019-12-27 08:59:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:59:40,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:59:40,801 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 08:59:40,801 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:59:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:59:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash 682722896, now seen corresponding path program 1 times [2019-12-27 08:59:40,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:59:40,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545696979] [2019-12-27 08:59:40,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:59:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:59:40,925 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 08:59:40,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545696979] [2019-12-27 08:59:40,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:59:40,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:59:40,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948627941] [2019-12-27 08:59:40,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:59:40,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:59:40,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:59:40,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:59:40,927 INFO L87 Difference]: Start difference. First operand 193995 states and 714236 transitions. Second operand 7 states. [2019-12-27 08:59:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:59:44,639 INFO L93 Difference]: Finished difference Result 277138 states and 986576 transitions. [2019-12-27 08:59:44,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 08:59:44,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 08:59:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:59:45,371 INFO L225 Difference]: With dead ends: 277138 [2019-12-27 08:59:45,371 INFO L226 Difference]: Without dead ends: 277138 [2019-12-27 08:59:45,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 08:59:49,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277138 states. [2019-12-27 09:00:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277138 to 222094. [2019-12-27 09:00:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222094 states. [2019-12-27 09:00:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222094 states to 222094 states and 805380 transitions. [2019-12-27 09:00:00,912 INFO L78 Accepts]: Start accepts. Automaton has 222094 states and 805380 transitions. Word has length 55 [2019-12-27 09:00:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:00,912 INFO L462 AbstractCegarLoop]: Abstraction has 222094 states and 805380 transitions. [2019-12-27 09:00:00,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:00:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 222094 states and 805380 transitions. [2019-12-27 09:00:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 09:00:00,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:00,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:00:00,938 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1570226577, now seen corresponding path program 1 times [2019-12-27 09:00:00,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:00,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418771661] [2019-12-27 09:00:00,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:01,002 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 09:00:01,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418771661] [2019-12-27 09:00:01,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:01,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:00:01,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239705868] [2019-12-27 09:00:01,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:00:01,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:01,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:00:01,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:00:01,004 INFO L87 Difference]: Start difference. First operand 222094 states and 805380 transitions. Second operand 3 states. [2019-12-27 09:00:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:07,241 INFO L93 Difference]: Finished difference Result 176990 states and 632038 transitions. [2019-12-27 09:00:07,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:00:07,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 09:00:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:07,703 INFO L225 Difference]: With dead ends: 176990 [2019-12-27 09:00:07,703 INFO L226 Difference]: Without dead ends: 176990 [2019-12-27 09:00:07,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:00:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176990 states. [2019-12-27 09:00:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176990 to 172178. [2019-12-27 09:00:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172178 states. [2019-12-27 09:00:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172178 states to 172178 states and 617063 transitions. [2019-12-27 09:00:13,391 INFO L78 Accepts]: Start accepts. Automaton has 172178 states and 617063 transitions. Word has length 55 [2019-12-27 09:00:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:13,391 INFO L462 AbstractCegarLoop]: Abstraction has 172178 states and 617063 transitions. [2019-12-27 09:00:13,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:00:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 172178 states and 617063 transitions. [2019-12-27 09:00:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:00:13,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:13,413 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 09:00:13,413 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2138572392, now seen corresponding path program 1 times [2019-12-27 09:00:13,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:13,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640276118] [2019-12-27 09:00:13,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:13,507 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 09:00:13,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640276118] [2019-12-27 09:00:13,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:13,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:00:13,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417303382] [2019-12-27 09:00:13,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:00:13,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:13,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:00:13,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:00:13,509 INFO L87 Difference]: Start difference. First operand 172178 states and 617063 transitions. Second operand 6 states. [2019-12-27 09:00:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:20,589 INFO L93 Difference]: Finished difference Result 216117 states and 757196 transitions. [2019-12-27 09:00:20,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:00:20,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 09:00:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:21,133 INFO L225 Difference]: With dead ends: 216117 [2019-12-27 09:00:21,134 INFO L226 Difference]: Without dead ends: 216117 [2019-12-27 09:00:21,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:00:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216117 states. [2019-12-27 09:00:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216117 to 185518. [2019-12-27 09:00:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185518 states. [2019-12-27 09:00:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185518 states to 185518 states and 660438 transitions. [2019-12-27 09:00:26,940 INFO L78 Accepts]: Start accepts. Automaton has 185518 states and 660438 transitions. Word has length 56 [2019-12-27 09:00:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:26,941 INFO L462 AbstractCegarLoop]: Abstraction has 185518 states and 660438 transitions. [2019-12-27 09:00:26,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:00:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 185518 states and 660438 transitions. [2019-12-27 09:00:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:00:26,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:26,962 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 09:00:26,962 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:26,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:26,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1251068711, now seen corresponding path program 1 times [2019-12-27 09:00:26,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:26,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029766883] [2019-12-27 09:00:26,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:00:27,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029766883] [2019-12-27 09:00:27,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:27,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:00:27,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606037826] [2019-12-27 09:00:27,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:00:27,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:27,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:00:27,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:00:27,041 INFO L87 Difference]: Start difference. First operand 185518 states and 660438 transitions. Second operand 4 states. [2019-12-27 09:00:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:27,180 INFO L93 Difference]: Finished difference Result 24458 states and 76334 transitions. [2019-12-27 09:00:27,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:00:27,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-27 09:00:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:27,221 INFO L225 Difference]: With dead ends: 24458 [2019-12-27 09:00:27,221 INFO L226 Difference]: Without dead ends: 18439 [2019-12-27 09:00:27,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:00:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18439 states. [2019-12-27 09:00:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18439 to 18192. [2019-12-27 09:00:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18192 states. [2019-12-27 09:00:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18192 states to 18192 states and 54575 transitions. [2019-12-27 09:00:27,478 INFO L78 Accepts]: Start accepts. Automaton has 18192 states and 54575 transitions. Word has length 56 [2019-12-27 09:00:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:27,478 INFO L462 AbstractCegarLoop]: Abstraction has 18192 states and 54575 transitions. [2019-12-27 09:00:27,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:00:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 18192 states and 54575 transitions. [2019-12-27 09:00:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 09:00:27,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:27,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:27,483 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash 152468231, now seen corresponding path program 1 times [2019-12-27 09:00:27,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:27,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690897550] [2019-12-27 09:00:27,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:27,551 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 09:00:27,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690897550] [2019-12-27 09:00:27,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:27,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:00:27,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427593412] [2019-12-27 09:00:27,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:00:27,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:27,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:00:27,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:00:27,553 INFO L87 Difference]: Start difference. First operand 18192 states and 54575 transitions. Second operand 4 states. [2019-12-27 09:00:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:27,818 INFO L93 Difference]: Finished difference Result 23512 states and 70753 transitions. [2019-12-27 09:00:27,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:00:27,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 09:00:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:27,852 INFO L225 Difference]: With dead ends: 23512 [2019-12-27 09:00:27,853 INFO L226 Difference]: Without dead ends: 23512 [2019-12-27 09:00:27,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:00:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23512 states. [2019-12-27 09:00:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23512 to 21214. [2019-12-27 09:00:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21214 states. [2019-12-27 09:00:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21214 states to 21214 states and 63560 transitions. [2019-12-27 09:00:30,065 INFO L78 Accepts]: Start accepts. Automaton has 21214 states and 63560 transitions. Word has length 65 [2019-12-27 09:00:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:30,065 INFO L462 AbstractCegarLoop]: Abstraction has 21214 states and 63560 transitions. [2019-12-27 09:00:30,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:00:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 21214 states and 63560 transitions. [2019-12-27 09:00:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 09:00:30,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:30,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:00:30,071 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:30,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1895278566, now seen corresponding path program 1 times [2019-12-27 09:00:30,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:30,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233908343] [2019-12-27 09:00:30,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:30,153 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 09:00:30,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233908343] [2019-12-27 09:00:30,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:30,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:00:30,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466640880] [2019-12-27 09:00:30,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:00:30,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:00:30,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:00:30,155 INFO L87 Difference]: Start difference. First operand 21214 states and 63560 transitions. Second operand 6 states. [2019-12-27 09:00:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:30,798 INFO L93 Difference]: Finished difference Result 30326 states and 89100 transitions. [2019-12-27 09:00:30,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:00:30,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 09:00:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:30,843 INFO L225 Difference]: With dead ends: 30326 [2019-12-27 09:00:30,843 INFO L226 Difference]: Without dead ends: 30278 [2019-12-27 09:00:30,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:00:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30278 states. [2019-12-27 09:00:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30278 to 27631. [2019-12-27 09:00:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27631 states. [2019-12-27 09:00:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 81447 transitions. [2019-12-27 09:00:31,232 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 81447 transitions. Word has length 65 [2019-12-27 09:00:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:31,232 INFO L462 AbstractCegarLoop]: Abstraction has 27631 states and 81447 transitions. [2019-12-27 09:00:31,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:00:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 81447 transitions. [2019-12-27 09:00:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 09:00:31,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:31,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:00:31,242 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:31,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:31,243 INFO L82 PathProgramCache]: Analyzing trace with hash -279598761, now seen corresponding path program 1 times [2019-12-27 09:00:31,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:31,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017448108] [2019-12-27 09:00:31,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:31,293 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 09:00:31,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017448108] [2019-12-27 09:00:31,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:31,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:00:31,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989370057] [2019-12-27 09:00:31,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:00:31,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:00:31,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:00:31,295 INFO L87 Difference]: Start difference. First operand 27631 states and 81447 transitions. Second operand 3 states. [2019-12-27 09:00:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:31,499 INFO L93 Difference]: Finished difference Result 30274 states and 87661 transitions. [2019-12-27 09:00:31,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:00:31,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-27 09:00:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:31,563 INFO L225 Difference]: With dead ends: 30274 [2019-12-27 09:00:31,563 INFO L226 Difference]: Without dead ends: 30274 [2019-12-27 09:00:31,564 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 09:00:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30274 states. [2019-12-27 09:00:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30274 to 26779. [2019-12-27 09:00:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26779 states. [2019-12-27 09:00:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26779 states to 26779 states and 76975 transitions. [2019-12-27 09:00:32,353 INFO L78 Accepts]: Start accepts. Automaton has 26779 states and 76975 transitions. Word has length 71 [2019-12-27 09:00:32,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:32,353 INFO L462 AbstractCegarLoop]: Abstraction has 26779 states and 76975 transitions. [2019-12-27 09:00:32,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:00:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 26779 states and 76975 transitions. [2019-12-27 09:00:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 09:00:32,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:32,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:00:32,364 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash 214408150, now seen corresponding path program 1 times [2019-12-27 09:00:32,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:32,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914131566] [2019-12-27 09:00:32,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:00:32,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914131566] [2019-12-27 09:00:32,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:32,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:00:32,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695573186] [2019-12-27 09:00:32,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:00:32,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:32,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:00:32,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:00:32,446 INFO L87 Difference]: Start difference. First operand 26779 states and 76975 transitions. Second operand 4 states. [2019-12-27 09:00:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:33,212 INFO L93 Difference]: Finished difference Result 35101 states and 101171 transitions. [2019-12-27 09:00:33,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:00:33,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-27 09:00:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:33,262 INFO L225 Difference]: With dead ends: 35101 [2019-12-27 09:00:33,262 INFO L226 Difference]: Without dead ends: 34678 [2019-12-27 09:00:33,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:00:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34678 states. [2019-12-27 09:00:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34678 to 32875. [2019-12-27 09:00:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32875 states. [2019-12-27 09:00:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32875 states to 32875 states and 94659 transitions. [2019-12-27 09:00:33,720 INFO L78 Accepts]: Start accepts. Automaton has 32875 states and 94659 transitions. Word has length 73 [2019-12-27 09:00:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:33,720 INFO L462 AbstractCegarLoop]: Abstraction has 32875 states and 94659 transitions. [2019-12-27 09:00:33,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:00:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 32875 states and 94659 transitions. [2019-12-27 09:00:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 09:00:33,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:33,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:00:33,735 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:33,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:33,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1582543209, now seen corresponding path program 1 times [2019-12-27 09:00:33,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:33,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985217982] [2019-12-27 09:00:33,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:33,877 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 09:00:33,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985217982] [2019-12-27 09:00:33,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:33,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:00:33,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75634219] [2019-12-27 09:00:33,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:00:33,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:33,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:00:33,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:00:33,879 INFO L87 Difference]: Start difference. First operand 32875 states and 94659 transitions. Second operand 8 states. [2019-12-27 09:00:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:35,308 INFO L93 Difference]: Finished difference Result 37960 states and 107978 transitions. [2019-12-27 09:00:35,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 09:00:35,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-12-27 09:00:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:35,361 INFO L225 Difference]: With dead ends: 37960 [2019-12-27 09:00:35,362 INFO L226 Difference]: Without dead ends: 37960 [2019-12-27 09:00:35,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:00:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37960 states. [2019-12-27 09:00:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37960 to 35135. [2019-12-27 09:00:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35135 states. [2019-12-27 09:00:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35135 states to 35135 states and 100532 transitions. [2019-12-27 09:00:36,065 INFO L78 Accepts]: Start accepts. Automaton has 35135 states and 100532 transitions. Word has length 73 [2019-12-27 09:00:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:36,065 INFO L462 AbstractCegarLoop]: Abstraction has 35135 states and 100532 transitions. [2019-12-27 09:00:36,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:00:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35135 states and 100532 transitions. [2019-12-27 09:00:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 09:00:36,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:36,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:00:36,081 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:36,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash -695039528, now seen corresponding path program 1 times [2019-12-27 09:00:36,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:36,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211411292] [2019-12-27 09:00:36,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:36,162 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 09:00:36,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211411292] [2019-12-27 09:00:36,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:36,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:00:36,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262767157] [2019-12-27 09:00:36,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:00:36,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:36,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:00:36,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:00:36,166 INFO L87 Difference]: Start difference. First operand 35135 states and 100532 transitions. Second operand 5 states. [2019-12-27 09:00:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:36,230 INFO L93 Difference]: Finished difference Result 10799 states and 26831 transitions. [2019-12-27 09:00:36,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:00:36,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-27 09:00:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:36,241 INFO L225 Difference]: With dead ends: 10799 [2019-12-27 09:00:36,241 INFO L226 Difference]: Without dead ends: 9416 [2019-12-27 09:00:36,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:00:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2019-12-27 09:00:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 7147. [2019-12-27 09:00:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7147 states. [2019-12-27 09:00:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7147 states to 7147 states and 17805 transitions. [2019-12-27 09:00:36,335 INFO L78 Accepts]: Start accepts. Automaton has 7147 states and 17805 transitions. Word has length 73 [2019-12-27 09:00:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:36,335 INFO L462 AbstractCegarLoop]: Abstraction has 7147 states and 17805 transitions. [2019-12-27 09:00:36,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:00:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 7147 states and 17805 transitions. [2019-12-27 09:00:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 09:00:36,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:36,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:36,343 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1038400068, now seen corresponding path program 1 times [2019-12-27 09:00:36,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:36,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228121558] [2019-12-27 09:00:36,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:36,418 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 09:00:36,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228121558] [2019-12-27 09:00:36,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:36,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:00:36,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798227226] [2019-12-27 09:00:36,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:00:36,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:36,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:00:36,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:00:36,420 INFO L87 Difference]: Start difference. First operand 7147 states and 17805 transitions. Second operand 4 states. [2019-12-27 09:00:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:36,651 INFO L93 Difference]: Finished difference Result 8303 states and 20316 transitions. [2019-12-27 09:00:36,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:00:36,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-27 09:00:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:36,662 INFO L225 Difference]: With dead ends: 8303 [2019-12-27 09:00:36,663 INFO L226 Difference]: Without dead ends: 8303 [2019-12-27 09:00:36,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:00:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2019-12-27 09:00:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 7769. [2019-12-27 09:00:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7769 states. [2019-12-27 09:00:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7769 states to 7769 states and 19157 transitions. [2019-12-27 09:00:36,753 INFO L78 Accepts]: Start accepts. Automaton has 7769 states and 19157 transitions. Word has length 102 [2019-12-27 09:00:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:36,753 INFO L462 AbstractCegarLoop]: Abstraction has 7769 states and 19157 transitions. [2019-12-27 09:00:36,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:00:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7769 states and 19157 transitions. [2019-12-27 09:00:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 09:00:36,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:36,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:36,761 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2011802747, now seen corresponding path program 1 times [2019-12-27 09:00:36,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:36,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145953814] [2019-12-27 09:00:36,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:36,897 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 09:00:36,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145953814] [2019-12-27 09:00:36,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:36,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:00:36,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833625285] [2019-12-27 09:00:36,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:00:36,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:00:36,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:00:36,899 INFO L87 Difference]: Start difference. First operand 7769 states and 19157 transitions. Second operand 7 states. [2019-12-27 09:00:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:37,371 INFO L93 Difference]: Finished difference Result 12566 states and 29871 transitions. [2019-12-27 09:00:37,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:00:37,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-27 09:00:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:37,390 INFO L225 Difference]: With dead ends: 12566 [2019-12-27 09:00:37,390 INFO L226 Difference]: Without dead ends: 12483 [2019-12-27 09:00:37,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:00:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12483 states. [2019-12-27 09:00:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12483 to 10248. [2019-12-27 09:00:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10248 states. [2019-12-27 09:00:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10248 states to 10248 states and 24634 transitions. [2019-12-27 09:00:37,520 INFO L78 Accepts]: Start accepts. Automaton has 10248 states and 24634 transitions. Word has length 102 [2019-12-27 09:00:37,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:37,521 INFO L462 AbstractCegarLoop]: Abstraction has 10248 states and 24634 transitions. [2019-12-27 09:00:37,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:00:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 10248 states and 24634 transitions. [2019-12-27 09:00:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 09:00:37,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:37,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:37,534 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:37,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:37,534 INFO L82 PathProgramCache]: Analyzing trace with hash 205955206, now seen corresponding path program 1 times [2019-12-27 09:00:37,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:37,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298784815] [2019-12-27 09:00:37,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:37,658 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 09:00:37,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298784815] [2019-12-27 09:00:37,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:37,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:00:37,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877442723] [2019-12-27 09:00:37,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:00:37,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:37,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:00:37,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:00:37,662 INFO L87 Difference]: Start difference. First operand 10248 states and 24634 transitions. Second operand 7 states. [2019-12-27 09:00:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:38,321 INFO L93 Difference]: Finished difference Result 13602 states and 31341 transitions. [2019-12-27 09:00:38,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 09:00:38,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-27 09:00:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:38,339 INFO L225 Difference]: With dead ends: 13602 [2019-12-27 09:00:38,340 INFO L226 Difference]: Without dead ends: 13602 [2019-12-27 09:00:38,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:00:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13602 states. [2019-12-27 09:00:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13602 to 11352. [2019-12-27 09:00:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11352 states. [2019-12-27 09:00:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11352 states to 11352 states and 26506 transitions. [2019-12-27 09:00:38,537 INFO L78 Accepts]: Start accepts. Automaton has 11352 states and 26506 transitions. Word has length 102 [2019-12-27 09:00:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:38,538 INFO L462 AbstractCegarLoop]: Abstraction has 11352 states and 26506 transitions. [2019-12-27 09:00:38,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:00:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 11352 states and 26506 transitions. [2019-12-27 09:00:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 09:00:38,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:38,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:38,549 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:38,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:38,550 INFO L82 PathProgramCache]: Analyzing trace with hash 417306119, now seen corresponding path program 1 times [2019-12-27 09:00:38,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:38,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777243832] [2019-12-27 09:00:38,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:38,643 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 09:00:38,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777243832] [2019-12-27 09:00:38,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:38,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:00:38,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128411200] [2019-12-27 09:00:38,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:00:38,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:38,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:00:38,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:00:38,645 INFO L87 Difference]: Start difference. First operand 11352 states and 26506 transitions. Second operand 7 states. [2019-12-27 09:00:39,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:39,394 INFO L93 Difference]: Finished difference Result 16338 states and 38011 transitions. [2019-12-27 09:00:39,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 09:00:39,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-27 09:00:39,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:39,415 INFO L225 Difference]: With dead ends: 16338 [2019-12-27 09:00:39,415 INFO L226 Difference]: Without dead ends: 16338 [2019-12-27 09:00:39,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 09:00:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16338 states. [2019-12-27 09:00:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16338 to 13871. [2019-12-27 09:00:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13871 states. [2019-12-27 09:00:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13871 states to 13871 states and 32508 transitions. [2019-12-27 09:00:39,586 INFO L78 Accepts]: Start accepts. Automaton has 13871 states and 32508 transitions. Word has length 102 [2019-12-27 09:00:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:39,586 INFO L462 AbstractCegarLoop]: Abstraction has 13871 states and 32508 transitions. [2019-12-27 09:00:39,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:00:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 13871 states and 32508 transitions. [2019-12-27 09:00:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 09:00:39,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:39,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:39,600 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:39,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:39,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1890179417, now seen corresponding path program 1 times [2019-12-27 09:00:39,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:39,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195410771] [2019-12-27 09:00:39,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:39,739 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 09:00:39,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195410771] [2019-12-27 09:00:39,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:39,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:00:39,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109845590] [2019-12-27 09:00:39,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:00:39,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:00:39,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:00:39,743 INFO L87 Difference]: Start difference. First operand 13871 states and 32508 transitions. Second operand 7 states. [2019-12-27 09:00:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:40,090 INFO L93 Difference]: Finished difference Result 14572 states and 33944 transitions. [2019-12-27 09:00:40,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:00:40,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-27 09:00:40,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:40,110 INFO L225 Difference]: With dead ends: 14572 [2019-12-27 09:00:40,110 INFO L226 Difference]: Without dead ends: 14572 [2019-12-27 09:00:40,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-27 09:00:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14572 states. [2019-12-27 09:00:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14572 to 12044. [2019-12-27 09:00:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12044 states. [2019-12-27 09:00:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12044 states to 12044 states and 28145 transitions. [2019-12-27 09:00:40,259 INFO L78 Accepts]: Start accepts. Automaton has 12044 states and 28145 transitions. Word has length 102 [2019-12-27 09:00:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:40,259 INFO L462 AbstractCegarLoop]: Abstraction has 12044 states and 28145 transitions. [2019-12-27 09:00:40,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:00:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 12044 states and 28145 transitions. [2019-12-27 09:00:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 09:00:40,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:40,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:40,271 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1002675736, now seen corresponding path program 1 times [2019-12-27 09:00:40,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:40,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459750715] [2019-12-27 09:00:40,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:00:40,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459750715] [2019-12-27 09:00:40,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:40,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:00:40,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112287607] [2019-12-27 09:00:40,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:00:40,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:40,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:00:40,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:00:40,375 INFO L87 Difference]: Start difference. First operand 12044 states and 28145 transitions. Second operand 4 states. [2019-12-27 09:00:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:40,642 INFO L93 Difference]: Finished difference Result 12513 states and 29244 transitions. [2019-12-27 09:00:40,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:00:40,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-27 09:00:40,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:40,667 INFO L225 Difference]: With dead ends: 12513 [2019-12-27 09:00:40,667 INFO L226 Difference]: Without dead ends: 12513 [2019-12-27 09:00:40,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 09:00:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12513 states. [2019-12-27 09:00:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12513 to 11642. [2019-12-27 09:00:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11642 states. [2019-12-27 09:00:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11642 states to 11642 states and 27259 transitions. [2019-12-27 09:00:40,923 INFO L78 Accepts]: Start accepts. Automaton has 11642 states and 27259 transitions. Word has length 102 [2019-12-27 09:00:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:40,924 INFO L462 AbstractCegarLoop]: Abstraction has 11642 states and 27259 transitions. [2019-12-27 09:00:40,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:00:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 11642 states and 27259 transitions. [2019-12-27 09:00:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 09:00:40,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:40,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:40,946 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1721649504, now seen corresponding path program 2 times [2019-12-27 09:00:40,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:40,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782979501] [2019-12-27 09:00:40,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:41,069 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 09:00:41,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782979501] [2019-12-27 09:00:41,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:41,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:00:41,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308897992] [2019-12-27 09:00:41,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:00:41,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:00:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:00:41,080 INFO L87 Difference]: Start difference. First operand 11642 states and 27259 transitions. Second operand 5 states. [2019-12-27 09:00:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:41,491 INFO L93 Difference]: Finished difference Result 12653 states and 29472 transitions. [2019-12-27 09:00:41,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:00:41,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-12-27 09:00:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:41,505 INFO L225 Difference]: With dead ends: 12653 [2019-12-27 09:00:41,506 INFO L226 Difference]: Without dead ends: 12653 [2019-12-27 09:00:41,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:00:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12653 states. [2019-12-27 09:00:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12653 to 11608. [2019-12-27 09:00:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11608 states. [2019-12-27 09:00:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11608 states to 11608 states and 27123 transitions. [2019-12-27 09:00:41,725 INFO L78 Accepts]: Start accepts. Automaton has 11608 states and 27123 transitions. Word has length 102 [2019-12-27 09:00:41,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:41,726 INFO L462 AbstractCegarLoop]: Abstraction has 11608 states and 27123 transitions. [2019-12-27 09:00:41,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:00:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 11608 states and 27123 transitions. [2019-12-27 09:00:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 09:00:41,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:41,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:41,736 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:41,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1014677636, now seen corresponding path program 3 times [2019-12-27 09:00:41,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:41,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119419524] [2019-12-27 09:00:41,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:41,824 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 09:00:41,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119419524] [2019-12-27 09:00:41,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:41,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:00:41,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340462978] [2019-12-27 09:00:41,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:00:41,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:41,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:00:41,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:00:41,827 INFO L87 Difference]: Start difference. First operand 11608 states and 27123 transitions. Second operand 6 states. [2019-12-27 09:00:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:42,414 INFO L93 Difference]: Finished difference Result 14312 states and 33369 transitions. [2019-12-27 09:00:42,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:00:42,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-12-27 09:00:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:42,431 INFO L225 Difference]: With dead ends: 14312 [2019-12-27 09:00:42,431 INFO L226 Difference]: Without dead ends: 14312 [2019-12-27 09:00:42,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:00:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14312 states. [2019-12-27 09:00:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14312 to 11638. [2019-12-27 09:00:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11638 states. [2019-12-27 09:00:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11638 states to 11638 states and 27186 transitions. [2019-12-27 09:00:42,577 INFO L78 Accepts]: Start accepts. Automaton has 11638 states and 27186 transitions. Word has length 102 [2019-12-27 09:00:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:42,577 INFO L462 AbstractCegarLoop]: Abstraction has 11638 states and 27186 transitions. [2019-12-27 09:00:42,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:00:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 11638 states and 27186 transitions. [2019-12-27 09:00:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 09:00:42,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:42,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:42,590 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:42,590 INFO L82 PathProgramCache]: Analyzing trace with hash 672175224, now seen corresponding path program 4 times [2019-12-27 09:00:42,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:42,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249530853] [2019-12-27 09:00:42,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:42,659 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 09:00:42,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249530853] [2019-12-27 09:00:42,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:42,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:00:42,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301784330] [2019-12-27 09:00:42,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:00:42,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:42,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:00:42,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:00:42,661 INFO L87 Difference]: Start difference. First operand 11638 states and 27186 transitions. Second operand 5 states. [2019-12-27 09:00:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:43,030 INFO L93 Difference]: Finished difference Result 13428 states and 30905 transitions. [2019-12-27 09:00:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:00:43,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-12-27 09:00:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:43,056 INFO L225 Difference]: With dead ends: 13428 [2019-12-27 09:00:43,056 INFO L226 Difference]: Without dead ends: 13428 [2019-12-27 09:00:43,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:00:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13428 states. [2019-12-27 09:00:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13428 to 11796. [2019-12-27 09:00:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11796 states. [2019-12-27 09:00:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11796 states to 11796 states and 27524 transitions. [2019-12-27 09:00:43,329 INFO L78 Accepts]: Start accepts. Automaton has 11796 states and 27524 transitions. Word has length 102 [2019-12-27 09:00:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:43,330 INFO L462 AbstractCegarLoop]: Abstraction has 11796 states and 27524 transitions. [2019-12-27 09:00:43,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:00:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 11796 states and 27524 transitions. [2019-12-27 09:00:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 09:00:43,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:43,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:43,350 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:43,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:43,351 INFO L82 PathProgramCache]: Analyzing trace with hash 680863437, now seen corresponding path program 1 times [2019-12-27 09:00:43,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:43,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366729444] [2019-12-27 09:00:43,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:43,432 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 09:00:43,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366729444] [2019-12-27 09:00:43,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:43,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:00:43,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370340761] [2019-12-27 09:00:43,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:00:43,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:00:43,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:00:43,438 INFO L87 Difference]: Start difference. First operand 11796 states and 27524 transitions. Second operand 3 states. [2019-12-27 09:00:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:43,516 INFO L93 Difference]: Finished difference Result 14480 states and 33774 transitions. [2019-12-27 09:00:43,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:00:43,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-27 09:00:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:43,538 INFO L225 Difference]: With dead ends: 14480 [2019-12-27 09:00:43,538 INFO L226 Difference]: Without dead ends: 14480 [2019-12-27 09:00:43,539 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 09:00:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2019-12-27 09:00:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14418. [2019-12-27 09:00:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14418 states. [2019-12-27 09:00:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14418 states to 14418 states and 33641 transitions. [2019-12-27 09:00:43,790 INFO L78 Accepts]: Start accepts. Automaton has 14418 states and 33641 transitions. Word has length 104 [2019-12-27 09:00:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:43,790 INFO L462 AbstractCegarLoop]: Abstraction has 14418 states and 33641 transitions. [2019-12-27 09:00:43,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:00:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 14418 states and 33641 transitions. [2019-12-27 09:00:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 09:00:43,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:43,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:43,812 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:43,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:43,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1031663374, now seen corresponding path program 1 times [2019-12-27 09:00:43,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:43,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331275549] [2019-12-27 09:00:43,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:44,022 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 09:00:44,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331275549] [2019-12-27 09:00:44,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:44,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 09:00:44,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333457209] [2019-12-27 09:00:44,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 09:00:44,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:44,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 09:00:44,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-27 09:00:44,024 INFO L87 Difference]: Start difference. First operand 14418 states and 33641 transitions. Second operand 11 states. [2019-12-27 09:00:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:44,634 INFO L93 Difference]: Finished difference Result 30788 states and 71169 transitions. [2019-12-27 09:00:44,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 09:00:44,634 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-12-27 09:00:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:44,664 INFO L225 Difference]: With dead ends: 30788 [2019-12-27 09:00:44,665 INFO L226 Difference]: Without dead ends: 25039 [2019-12-27 09:00:44,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2019-12-27 09:00:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25039 states. [2019-12-27 09:00:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25039 to 18920. [2019-12-27 09:00:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18920 states. [2019-12-27 09:00:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18920 states to 18920 states and 44057 transitions. [2019-12-27 09:00:45,084 INFO L78 Accepts]: Start accepts. Automaton has 18920 states and 44057 transitions. Word has length 104 [2019-12-27 09:00:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:45,084 INFO L462 AbstractCegarLoop]: Abstraction has 18920 states and 44057 transitions. [2019-12-27 09:00:45,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 09:00:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 18920 states and 44057 transitions. [2019-12-27 09:00:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 09:00:45,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:45,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:45,102 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:45,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:45,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1264987764, now seen corresponding path program 2 times [2019-12-27 09:00:45,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:45,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582197120] [2019-12-27 09:00:45,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:45,329 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 09:00:45,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582197120] [2019-12-27 09:00:45,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:45,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 09:00:45,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72262] [2019-12-27 09:00:45,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 09:00:45,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:45,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 09:00:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:00:45,330 INFO L87 Difference]: Start difference. First operand 18920 states and 44057 transitions. Second operand 12 states. [2019-12-27 09:00:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:46,252 INFO L93 Difference]: Finished difference Result 35653 states and 82065 transitions. [2019-12-27 09:00:46,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 09:00:46,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-12-27 09:00:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:46,292 INFO L225 Difference]: With dead ends: 35653 [2019-12-27 09:00:46,292 INFO L226 Difference]: Without dead ends: 32950 [2019-12-27 09:00:46,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2019-12-27 09:00:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32950 states. [2019-12-27 09:00:46,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32950 to 22543. [2019-12-27 09:00:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22543 states. [2019-12-27 09:00:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22543 states to 22543 states and 52525 transitions. [2019-12-27 09:00:46,595 INFO L78 Accepts]: Start accepts. Automaton has 22543 states and 52525 transitions. Word has length 104 [2019-12-27 09:00:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:46,595 INFO L462 AbstractCegarLoop]: Abstraction has 22543 states and 52525 transitions. [2019-12-27 09:00:46,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 09:00:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22543 states and 52525 transitions. [2019-12-27 09:00:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 09:00:46,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:46,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:46,615 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:46,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:46,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1268769222, now seen corresponding path program 1 times [2019-12-27 09:00:46,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:46,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882493593] [2019-12-27 09:00:46,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:46,765 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 09:00:46,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882493593] [2019-12-27 09:00:46,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:46,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:00:46,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416010449] [2019-12-27 09:00:46,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:00:46,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:46,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:00:46,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:00:46,768 INFO L87 Difference]: Start difference. First operand 22543 states and 52525 transitions. Second operand 8 states. [2019-12-27 09:00:47,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:47,002 INFO L93 Difference]: Finished difference Result 23016 states and 53571 transitions. [2019-12-27 09:00:47,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:00:47,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-12-27 09:00:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:47,007 INFO L225 Difference]: With dead ends: 23016 [2019-12-27 09:00:47,007 INFO L226 Difference]: Without dead ends: 2995 [2019-12-27 09:00:47,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:00:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-12-27 09:00:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2993. [2019-12-27 09:00:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2993 states. [2019-12-27 09:00:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 7025 transitions. [2019-12-27 09:00:47,059 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 7025 transitions. Word has length 104 [2019-12-27 09:00:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:47,060 INFO L462 AbstractCegarLoop]: Abstraction has 2993 states and 7025 transitions. [2019-12-27 09:00:47,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:00:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 7025 transitions. [2019-12-27 09:00:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 09:00:47,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:47,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:47,067 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:47,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1538969505, now seen corresponding path program 1 times [2019-12-27 09:00:47,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:47,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458120887] [2019-12-27 09:00:47,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:47,154 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 09:00:47,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458120887] [2019-12-27 09:00:47,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:47,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:00:47,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587792036] [2019-12-27 09:00:47,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:00:47,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:47,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:00:47,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:00:47,160 INFO L87 Difference]: Start difference. First operand 2993 states and 7025 transitions. Second operand 5 states. [2019-12-27 09:00:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:47,431 INFO L93 Difference]: Finished difference Result 3318 states and 7717 transitions. [2019-12-27 09:00:47,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:00:47,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-12-27 09:00:47,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:47,435 INFO L225 Difference]: With dead ends: 3318 [2019-12-27 09:00:47,436 INFO L226 Difference]: Without dead ends: 3296 [2019-12-27 09:00:47,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:00:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3296 states. [2019-12-27 09:00:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3296 to 3045. [2019-12-27 09:00:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3045 states. [2019-12-27 09:00:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 7141 transitions. [2019-12-27 09:00:47,483 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 7141 transitions. Word has length 104 [2019-12-27 09:00:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:47,484 INFO L462 AbstractCegarLoop]: Abstraction has 3045 states and 7141 transitions. [2019-12-27 09:00:47,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:00:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 7141 transitions. [2019-12-27 09:00:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 09:00:47,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:47,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:47,489 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1502982559, now seen corresponding path program 1 times [2019-12-27 09:00:47,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:47,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412390292] [2019-12-27 09:00:47,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:47,652 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 09:00:47,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412390292] [2019-12-27 09:00:47,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:47,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:00:47,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852537539] [2019-12-27 09:00:47,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:00:47,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:47,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:00:47,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:00:47,654 INFO L87 Difference]: Start difference. First operand 3045 states and 7141 transitions. Second operand 8 states. [2019-12-27 09:00:48,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:48,009 INFO L93 Difference]: Finished difference Result 3328 states and 7755 transitions. [2019-12-27 09:00:48,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:00:48,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-12-27 09:00:48,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:48,014 INFO L225 Difference]: With dead ends: 3328 [2019-12-27 09:00:48,014 INFO L226 Difference]: Without dead ends: 3328 [2019-12-27 09:00:48,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-12-27 09:00:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2019-12-27 09:00:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3033. [2019-12-27 09:00:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3033 states. [2019-12-27 09:00:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 7106 transitions. [2019-12-27 09:00:48,045 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 7106 transitions. Word has length 104 [2019-12-27 09:00:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:48,045 INFO L462 AbstractCegarLoop]: Abstraction has 3033 states and 7106 transitions. [2019-12-27 09:00:48,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:00:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 7106 transitions. [2019-12-27 09:00:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 09:00:48,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:48,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:48,049 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:48,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1904481056, now seen corresponding path program 1 times [2019-12-27 09:00:48,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:48,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243846393] [2019-12-27 09:00:48,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:48,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 09:00:48,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243846393] [2019-12-27 09:00:48,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:48,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:00:48,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446281966] [2019-12-27 09:00:48,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:00:48,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:48,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:00:48,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:00:48,148 INFO L87 Difference]: Start difference. First operand 3033 states and 7106 transitions. Second operand 7 states. [2019-12-27 09:00:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:48,503 INFO L93 Difference]: Finished difference Result 3400 states and 8037 transitions. [2019-12-27 09:00:48,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:00:48,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-12-27 09:00:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:48,508 INFO L225 Difference]: With dead ends: 3400 [2019-12-27 09:00:48,509 INFO L226 Difference]: Without dead ends: 3400 [2019-12-27 09:00:48,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:00:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2019-12-27 09:00:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 2975. [2019-12-27 09:00:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-12-27 09:00:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 6988 transitions. [2019-12-27 09:00:48,560 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 6988 transitions. Word has length 104 [2019-12-27 09:00:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:48,560 INFO L462 AbstractCegarLoop]: Abstraction has 2975 states and 6988 transitions. [2019-12-27 09:00:48,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:00:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 6988 transitions. [2019-12-27 09:00:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 09:00:48,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:48,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:48,565 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash 636284413, now seen corresponding path program 2 times [2019-12-27 09:00:48,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:48,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895803713] [2019-12-27 09:00:48,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:48,738 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 09:00:48,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895803713] [2019-12-27 09:00:48,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:48,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 09:00:48,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784195717] [2019-12-27 09:00:48,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 09:00:48,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:48,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 09:00:48,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 09:00:48,741 INFO L87 Difference]: Start difference. First operand 2975 states and 6988 transitions. Second operand 11 states. [2019-12-27 09:00:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:49,161 INFO L93 Difference]: Finished difference Result 4758 states and 10888 transitions. [2019-12-27 09:00:49,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 09:00:49,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-12-27 09:00:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:49,167 INFO L225 Difference]: With dead ends: 4758 [2019-12-27 09:00:49,167 INFO L226 Difference]: Without dead ends: 3430 [2019-12-27 09:00:49,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-27 09:00:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2019-12-27 09:00:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3026. [2019-12-27 09:00:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3026 states. [2019-12-27 09:00:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 7043 transitions. [2019-12-27 09:00:49,199 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 7043 transitions. Word has length 104 [2019-12-27 09:00:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:49,199 INFO L462 AbstractCegarLoop]: Abstraction has 3026 states and 7043 transitions. [2019-12-27 09:00:49,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 09:00:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 7043 transitions. [2019-12-27 09:00:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-27 09:00:49,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:49,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:00:49,202 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:49,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:49,203 INFO L82 PathProgramCache]: Analyzing trace with hash 586103867, now seen corresponding path program 3 times [2019-12-27 09:00:49,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:49,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724549019] [2019-12-27 09:00:49,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:00:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:00:49,295 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 09:00:49,295 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 09:00:49,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:00:49 BasicIcfg [2019-12-27 09:00:49,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 09:00:49,532 INFO L168 Benchmark]: Toolchain (without parser) took 147391.64 ms. Allocated memory was 138.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.4 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 458.8 MB. Max. memory is 7.1 GB. [2019-12-27 09:00:49,532 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 09:00:49,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 874.71 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 154.2 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 09:00:49,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.31 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 09:00:49,535 INFO L168 Benchmark]: Boogie Preprocessor took 43.08 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 148.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 09:00:49,535 INFO L168 Benchmark]: RCFGBuilder took 961.61 ms. Allocated memory is still 202.9 MB. Free memory was 148.8 MB in the beginning and 95.3 MB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. [2019-12-27 09:00:49,536 INFO L168 Benchmark]: TraceAbstraction took 145433.37 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 95.3 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 388.2 MB. Max. memory is 7.1 GB. [2019-12-27 09:00:49,539 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.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 874.71 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 154.2 MB in the end (delta: -53.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.31 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.08 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 148.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 961.61 ms. Allocated memory is still 202.9 MB. Free memory was 148.8 MB in the beginning and 95.3 MB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 145433.37 ms. Allocated memory was 202.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 95.3 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 388.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L709] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L710] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L711] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L712] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L713] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L714] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L715] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L716] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L717] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L718] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L719] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L720] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L721] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 0 pthread_t t4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] FCALL, FORK 0 pthread_create(&t4, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L814] 0 pthread_t t5; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t5, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 1 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L824] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 144.9s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 54.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12385 SDtfs, 14033 SDslu, 35619 SDs, 0 SdLazy, 10976 SolverSat, 577 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 95 SyntacticMatches, 28 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222094occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 238033 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2794 NumberOfCodeBlocks, 2794 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2657 ConstructedInterpolants, 0 QuantifiedInterpolants, 648155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...