/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_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:52:57,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:52:57,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:52:57,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:52:57,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:52:57,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:52:57,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:52:57,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:52:57,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:52:57,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:52:57,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:52:57,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:52:57,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:52:57,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:52:57,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:52:57,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:52:57,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:52:57,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:52:57,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:52:57,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:52:57,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:52:57,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:52:57,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:52:57,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:52:57,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:52:57,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:52:57,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:52:57,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:52:57,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:52:57,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:52:57,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:52:57,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:52:57,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:52:57,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:52:57,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:52:57,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:52:57,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:52:57,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:52:57,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:52:57,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:52:57,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:52:57,637 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-18 23:52:57,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:52:57,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:52:57,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:52:57,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:52:57,660 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:52:57,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:52:57,660 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:52:57,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:52:57,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:52:57,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:52:57,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:52:57,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:52:57,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:52:57,662 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:52:57,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:52:57,663 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:52:57,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:52:57,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:52:57,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:52:57,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:52:57,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:52:57,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:52:57,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:52:57,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:52:57,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:52:57,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:52:57,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:52:57,665 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-18 23:52:57,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:52:57,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:52:57,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:52:57,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:52:57,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:52:57,987 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:52:57,988 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:52:57,989 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_power.opt.i [2019-12-18 23:52:58,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/376789218/861cf3b456124fbfb9e5cc5e31b8710e/FLAGfb852953a [2019-12-18 23:52:58,650 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:52:58,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_power.opt.i [2019-12-18 23:52:58,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/376789218/861cf3b456124fbfb9e5cc5e31b8710e/FLAGfb852953a [2019-12-18 23:52:58,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/376789218/861cf3b456124fbfb9e5cc5e31b8710e [2019-12-18 23:52:58,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:52:58,916 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:52:58,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:52:58,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:52:58,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:52:58,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:52:58" (1/1) ... [2019-12-18 23:52:58,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd22070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:58, skipping insertion in model container [2019-12-18 23:52:58,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:52:58" (1/1) ... [2019-12-18 23:52:58,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:52:58,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:52:59,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:52:59,574 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:52:59,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:52:59,746 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:52:59,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59 WrapperNode [2019-12-18 23:52:59,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:52:59,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:52:59,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:52:59,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:52:59,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59" (1/1) ... [2019-12-18 23:52:59,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59" (1/1) ... [2019-12-18 23:52:59,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:52:59,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:52:59,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:52:59,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:52:59,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59" (1/1) ... [2019-12-18 23:52:59,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59" (1/1) ... [2019-12-18 23:52:59,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59" (1/1) ... [2019-12-18 23:52:59,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59" (1/1) ... [2019-12-18 23:52:59,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59" (1/1) ... [2019-12-18 23:52:59,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59" (1/1) ... [2019-12-18 23:52:59,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59" (1/1) ... [2019-12-18 23:52:59,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:52:59,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:52:59,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:52:59,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:52:59,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59" (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-18 23:52:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:52:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:52:59,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:52:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:52:59,944 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:52:59,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:52:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:52:59,946 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:52:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:52:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:52:59,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:52:59,949 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:53:00,783 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:53:00,783 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:53:00,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:53:00 BoogieIcfgContainer [2019-12-18 23:53:00,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:53:00,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:53:00,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:53:00,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:53:00,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:52:58" (1/3) ... [2019-12-18 23:53:00,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b0a21fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:53:00, skipping insertion in model container [2019-12-18 23:53:00,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:59" (2/3) ... [2019-12-18 23:53:00,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b0a21fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:53:00, skipping insertion in model container [2019-12-18 23:53:00,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:53:00" (3/3) ... [2019-12-18 23:53:00,794 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_power.opt.i [2019-12-18 23:53:00,805 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:53:00,805 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:53:00,813 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:53:00,814 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:53:00,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,874 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,875 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,895 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,895 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,923 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,945 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,949 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:53:00,966 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:53:00,991 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:53:00,991 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:53:00,992 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:53:00,992 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:53:00,992 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:53:00,992 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:53:00,992 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:53:00,992 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:53:01,010 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 179 places, 228 transitions [2019-12-18 23:53:09,280 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80073 states. [2019-12-18 23:53:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand 80073 states. [2019-12-18 23:53:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 23:53:09,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:53:09,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:53:09,294 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:53:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:53:09,299 INFO L82 PathProgramCache]: Analyzing trace with hash -37838152, now seen corresponding path program 1 times [2019-12-18 23:53:09,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:53:09,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892577680] [2019-12-18 23:53:09,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:53:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:53:09,640 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-18 23:53:09,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892577680] [2019-12-18 23:53:09,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:53:09,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:53:09,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719957868] [2019-12-18 23:53:09,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:53:09,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:53:09,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:53:09,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:53:09,664 INFO L87 Difference]: Start difference. First operand 80073 states. Second operand 4 states. [2019-12-18 23:53:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:53:11,525 INFO L93 Difference]: Finished difference Result 80713 states and 324638 transitions. [2019-12-18 23:53:11,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:53:11,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 23:53:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:53:12,032 INFO L225 Difference]: With dead ends: 80713 [2019-12-18 23:53:12,033 INFO L226 Difference]: Without dead ends: 59001 [2019-12-18 23:53:12,034 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-18 23:53:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59001 states. [2019-12-18 23:53:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59001 to 59001. [2019-12-18 23:53:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59001 states. [2019-12-18 23:53:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59001 states to 59001 states and 240126 transitions. [2019-12-18 23:53:18,912 INFO L78 Accepts]: Start accepts. Automaton has 59001 states and 240126 transitions. Word has length 40 [2019-12-18 23:53:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:53:18,914 INFO L462 AbstractCegarLoop]: Abstraction has 59001 states and 240126 transitions. [2019-12-18 23:53:18,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:53:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 59001 states and 240126 transitions. [2019-12-18 23:53:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 23:53:18,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:53:18,929 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-18 23:53:18,929 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:53:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:53:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1935034616, now seen corresponding path program 1 times [2019-12-18 23:53:18,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:53:18,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617211766] [2019-12-18 23:53:18,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:53:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:53:19,108 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-18 23:53:19,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617211766] [2019-12-18 23:53:19,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:53:19,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:53:19,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282784523] [2019-12-18 23:53:19,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:53:19,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:53:19,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:53:19,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:53:19,115 INFO L87 Difference]: Start difference. First operand 59001 states and 240126 transitions. Second operand 5 states. [2019-12-18 23:53:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:53:20,439 INFO L93 Difference]: Finished difference Result 95595 states and 363717 transitions. [2019-12-18 23:53:20,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:53:20,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-18 23:53:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:53:21,623 INFO L225 Difference]: With dead ends: 95595 [2019-12-18 23:53:21,623 INFO L226 Difference]: Without dead ends: 95043 [2019-12-18 23:53:21,624 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-18 23:53:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95043 states. [2019-12-18 23:53:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95043 to 93165. [2019-12-18 23:53:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93165 states. [2019-12-18 23:53:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93165 states to 93165 states and 356303 transitions. [2019-12-18 23:53:27,280 INFO L78 Accepts]: Start accepts. Automaton has 93165 states and 356303 transitions. Word has length 48 [2019-12-18 23:53:27,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:53:27,282 INFO L462 AbstractCegarLoop]: Abstraction has 93165 states and 356303 transitions. [2019-12-18 23:53:27,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:53:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 93165 states and 356303 transitions. [2019-12-18 23:53:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-18 23:53:27,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:53:27,289 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-18 23:53:27,289 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:53:27,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:53:27,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1649757835, now seen corresponding path program 1 times [2019-12-18 23:53:27,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:53:27,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479688030] [2019-12-18 23:53:27,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:53:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:53:27,420 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-18 23:53:27,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479688030] [2019-12-18 23:53:27,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:53:27,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:53:27,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928255294] [2019-12-18 23:53:27,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:53:27,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:53:27,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:53:27,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:53:27,423 INFO L87 Difference]: Start difference. First operand 93165 states and 356303 transitions. Second operand 5 states. [2019-12-18 23:53:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:53:31,405 INFO L93 Difference]: Finished difference Result 118509 states and 442884 transitions. [2019-12-18 23:53:31,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:53:31,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-18 23:53:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:53:31,758 INFO L225 Difference]: With dead ends: 118509 [2019-12-18 23:53:31,758 INFO L226 Difference]: Without dead ends: 118061 [2019-12-18 23:53:31,759 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-18 23:53:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118061 states. [2019-12-18 23:53:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118061 to 104154. [2019-12-18 23:53:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104154 states. [2019-12-18 23:53:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104154 states to 104154 states and 394237 transitions. [2019-12-18 23:53:35,808 INFO L78 Accepts]: Start accepts. Automaton has 104154 states and 394237 transitions. Word has length 49 [2019-12-18 23:53:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:53:35,810 INFO L462 AbstractCegarLoop]: Abstraction has 104154 states and 394237 transitions. [2019-12-18 23:53:35,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:53:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 104154 states and 394237 transitions. [2019-12-18 23:53:35,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 23:53:35,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:53:35,821 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-18 23:53:35,821 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:53:35,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:53:35,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1457879985, now seen corresponding path program 1 times [2019-12-18 23:53:35,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:53:35,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444952112] [2019-12-18 23:53:35,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:53:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:53:35,903 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-18 23:53:35,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444952112] [2019-12-18 23:53:35,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:53:35,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:53:35,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784438476] [2019-12-18 23:53:35,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:53:35,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:53:35,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:53:35,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:53:35,906 INFO L87 Difference]: Start difference. First operand 104154 states and 394237 transitions. Second operand 3 states. [2019-12-18 23:53:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:53:40,673 INFO L93 Difference]: Finished difference Result 170912 states and 627059 transitions. [2019-12-18 23:53:40,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:53:40,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 23:53:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:53:41,137 INFO L225 Difference]: With dead ends: 170912 [2019-12-18 23:53:41,137 INFO L226 Difference]: Without dead ends: 170912 [2019-12-18 23:53:41,137 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-18 23:53:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170912 states. [2019-12-18 23:53:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170912 to 157190. [2019-12-18 23:53:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157190 states. [2019-12-18 23:53:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157190 states to 157190 states and 581291 transitions. [2019-12-18 23:53:46,692 INFO L78 Accepts]: Start accepts. Automaton has 157190 states and 581291 transitions. Word has length 51 [2019-12-18 23:53:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:53:46,692 INFO L462 AbstractCegarLoop]: Abstraction has 157190 states and 581291 transitions. [2019-12-18 23:53:46,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:53:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 157190 states and 581291 transitions. [2019-12-18 23:53:46,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:53:46,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:53:46,718 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-18 23:53:46,718 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:53:46,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:53:46,718 INFO L82 PathProgramCache]: Analyzing trace with hash -98676228, now seen corresponding path program 1 times [2019-12-18 23:53:46,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:53:46,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809377490] [2019-12-18 23:53:46,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:53:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:53:46,797 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-18 23:53:46,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809377490] [2019-12-18 23:53:46,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:53:46,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:53:46,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307268964] [2019-12-18 23:53:46,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:53:46,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:53:46,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:53:46,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:53:46,800 INFO L87 Difference]: Start difference. First operand 157190 states and 581291 transitions. Second operand 6 states. [2019-12-18 23:53:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:53:49,640 INFO L93 Difference]: Finished difference Result 212574 states and 766173 transitions. [2019-12-18 23:53:49,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:53:49,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 23:53:49,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:53:50,196 INFO L225 Difference]: With dead ends: 212574 [2019-12-18 23:53:50,196 INFO L226 Difference]: Without dead ends: 212054 [2019-12-18 23:53:50,197 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-18 23:53:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212054 states. [2019-12-18 23:53:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212054 to 157972. [2019-12-18 23:53:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157972 states. [2019-12-18 23:54:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157972 states to 157972 states and 584228 transitions. [2019-12-18 23:54:01,303 INFO L78 Accepts]: Start accepts. Automaton has 157972 states and 584228 transitions. Word has length 55 [2019-12-18 23:54:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:54:01,303 INFO L462 AbstractCegarLoop]: Abstraction has 157972 states and 584228 transitions. [2019-12-18 23:54:01,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:54:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 157972 states and 584228 transitions. [2019-12-18 23:54:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:54:01,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:54:01,322 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-18 23:54:01,322 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:54:01,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:54:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1815293041, now seen corresponding path program 1 times [2019-12-18 23:54:01,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:54:01,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957353398] [2019-12-18 23:54:01,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:54:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:54:01,440 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-18 23:54:01,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957353398] [2019-12-18 23:54:01,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:54:01,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:54:01,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372802729] [2019-12-18 23:54:01,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:54:01,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:54:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:54:01,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:54:01,443 INFO L87 Difference]: Start difference. First operand 157972 states and 584228 transitions. Second operand 6 states. [2019-12-18 23:54:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:54:03,186 INFO L93 Difference]: Finished difference Result 208199 states and 766452 transitions. [2019-12-18 23:54:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:54:03,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 23:54:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:54:09,482 INFO L225 Difference]: With dead ends: 208199 [2019-12-18 23:54:09,482 INFO L226 Difference]: Without dead ends: 208199 [2019-12-18 23:54:09,482 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-18 23:54:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208199 states. [2019-12-18 23:54:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208199 to 193995. [2019-12-18 23:54:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193995 states. [2019-12-18 23:54:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193995 states to 193995 states and 714236 transitions. [2019-12-18 23:54:15,766 INFO L78 Accepts]: Start accepts. Automaton has 193995 states and 714236 transitions. Word has length 55 [2019-12-18 23:54:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:54:15,767 INFO L462 AbstractCegarLoop]: Abstraction has 193995 states and 714236 transitions. [2019-12-18 23:54:15,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:54:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 193995 states and 714236 transitions. [2019-12-18 23:54:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:54:15,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:54:15,791 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-18 23:54:15,791 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:54:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:54:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash 682722896, now seen corresponding path program 1 times [2019-12-18 23:54:15,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:54:15,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396322181] [2019-12-18 23:54:15,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:54:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:54:15,906 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-18 23:54:15,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396322181] [2019-12-18 23:54:15,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:54:15,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:54:15,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897878999] [2019-12-18 23:54:15,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:54:15,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:54:15,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:54:15,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:54:15,908 INFO L87 Difference]: Start difference. First operand 193995 states and 714236 transitions. Second operand 7 states. [2019-12-18 23:54:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:54:18,319 INFO L93 Difference]: Finished difference Result 277138 states and 986576 transitions. [2019-12-18 23:54:18,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 23:54:18,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 23:54:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:54:20,675 INFO L225 Difference]: With dead ends: 277138 [2019-12-18 23:54:20,675 INFO L226 Difference]: Without dead ends: 277138 [2019-12-18 23:54:20,676 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-18 23:54:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277138 states. [2019-12-18 23:54:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277138 to 222094. [2019-12-18 23:54:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222094 states. [2019-12-18 23:54:35,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222094 states to 222094 states and 805380 transitions. [2019-12-18 23:54:35,516 INFO L78 Accepts]: Start accepts. Automaton has 222094 states and 805380 transitions. Word has length 55 [2019-12-18 23:54:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:54:35,517 INFO L462 AbstractCegarLoop]: Abstraction has 222094 states and 805380 transitions. [2019-12-18 23:54:35,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:54:35,517 INFO L276 IsEmpty]: Start isEmpty. Operand 222094 states and 805380 transitions. [2019-12-18 23:54:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 23:54:35,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:54:35,544 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-18 23:54:35,544 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:54:35,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:54:35,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1570226577, now seen corresponding path program 1 times [2019-12-18 23:54:35,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:54:35,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157637529] [2019-12-18 23:54:35,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:54:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:54:35,639 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-18 23:54:35,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157637529] [2019-12-18 23:54:35,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:54:35,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:54:35,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279251154] [2019-12-18 23:54:35,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:54:35,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:54:35,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:54:35,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:54:35,641 INFO L87 Difference]: Start difference. First operand 222094 states and 805380 transitions. Second operand 3 states. [2019-12-18 23:54:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:54:36,339 INFO L93 Difference]: Finished difference Result 176990 states and 632038 transitions. [2019-12-18 23:54:36,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:54:36,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 23:54:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:54:36,754 INFO L225 Difference]: With dead ends: 176990 [2019-12-18 23:54:36,754 INFO L226 Difference]: Without dead ends: 176990 [2019-12-18 23:54:36,754 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-18 23:54:44,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176990 states. [2019-12-18 23:54:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176990 to 172178. [2019-12-18 23:54:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172178 states. [2019-12-18 23:54:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172178 states to 172178 states and 617063 transitions. [2019-12-18 23:54:47,819 INFO L78 Accepts]: Start accepts. Automaton has 172178 states and 617063 transitions. Word has length 55 [2019-12-18 23:54:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:54:47,820 INFO L462 AbstractCegarLoop]: Abstraction has 172178 states and 617063 transitions. [2019-12-18 23:54:47,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:54:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 172178 states and 617063 transitions. [2019-12-18 23:54:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 23:54:47,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:54:47,842 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-18 23:54:47,842 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:54:47,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:54:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2138572392, now seen corresponding path program 1 times [2019-12-18 23:54:47,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:54:47,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125915599] [2019-12-18 23:54:47,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:54:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:54:47,940 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-18 23:54:47,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125915599] [2019-12-18 23:54:47,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:54:47,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:54:47,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229751524] [2019-12-18 23:54:47,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:54:47,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:54:47,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:54:47,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:54:47,945 INFO L87 Difference]: Start difference. First operand 172178 states and 617063 transitions. Second operand 6 states. [2019-12-18 23:54:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:54:50,554 INFO L93 Difference]: Finished difference Result 216117 states and 757196 transitions. [2019-12-18 23:54:50,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:54:50,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 23:54:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:54:51,100 INFO L225 Difference]: With dead ends: 216117 [2019-12-18 23:54:51,100 INFO L226 Difference]: Without dead ends: 216117 [2019-12-18 23:54:51,101 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-18 23:54:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216117 states. [2019-12-18 23:55:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216117 to 185518. [2019-12-18 23:55:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185518 states. [2019-12-18 23:55:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185518 states to 185518 states and 660438 transitions. [2019-12-18 23:55:01,839 INFO L78 Accepts]: Start accepts. Automaton has 185518 states and 660438 transitions. Word has length 56 [2019-12-18 23:55:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:01,840 INFO L462 AbstractCegarLoop]: Abstraction has 185518 states and 660438 transitions. [2019-12-18 23:55:01,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:55:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 185518 states and 660438 transitions. [2019-12-18 23:55:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 23:55:01,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:01,860 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-18 23:55:01,860 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1251068711, now seen corresponding path program 1 times [2019-12-18 23:55:01,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:01,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799838634] [2019-12-18 23:55:01,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:01,921 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-18 23:55:01,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799838634] [2019-12-18 23:55:01,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:01,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:55:01,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679401590] [2019-12-18 23:55:01,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:55:01,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:01,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:55:01,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:55:01,923 INFO L87 Difference]: Start difference. First operand 185518 states and 660438 transitions. Second operand 4 states. [2019-12-18 23:55:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:02,042 INFO L93 Difference]: Finished difference Result 24458 states and 76334 transitions. [2019-12-18 23:55:02,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:55:02,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-18 23:55:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:02,081 INFO L225 Difference]: With dead ends: 24458 [2019-12-18 23:55:02,081 INFO L226 Difference]: Without dead ends: 18439 [2019-12-18 23:55:02,081 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-18 23:55:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18439 states. [2019-12-18 23:55:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18439 to 18192. [2019-12-18 23:55:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18192 states. [2019-12-18 23:55:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18192 states to 18192 states and 54575 transitions. [2019-12-18 23:55:03,432 INFO L78 Accepts]: Start accepts. Automaton has 18192 states and 54575 transitions. Word has length 56 [2019-12-18 23:55:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:03,432 INFO L462 AbstractCegarLoop]: Abstraction has 18192 states and 54575 transitions. [2019-12-18 23:55:03,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:55:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 18192 states and 54575 transitions. [2019-12-18 23:55:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 23:55:03,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:03,437 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-18 23:55:03,437 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash 152468231, now seen corresponding path program 1 times [2019-12-18 23:55:03,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:03,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725199290] [2019-12-18 23:55:03,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:03,491 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-18 23:55:03,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725199290] [2019-12-18 23:55:03,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:03,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:55:03,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276001320] [2019-12-18 23:55:03,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:55:03,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:55:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:55:03,493 INFO L87 Difference]: Start difference. First operand 18192 states and 54575 transitions. Second operand 4 states. [2019-12-18 23:55:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:03,740 INFO L93 Difference]: Finished difference Result 23512 states and 70753 transitions. [2019-12-18 23:55:03,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:55:03,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 23:55:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:03,774 INFO L225 Difference]: With dead ends: 23512 [2019-12-18 23:55:03,774 INFO L226 Difference]: Without dead ends: 23512 [2019-12-18 23:55:03,774 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-18 23:55:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23512 states. [2019-12-18 23:55:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23512 to 21214. [2019-12-18 23:55:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21214 states. [2019-12-18 23:55:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21214 states to 21214 states and 63560 transitions. [2019-12-18 23:55:04,065 INFO L78 Accepts]: Start accepts. Automaton has 21214 states and 63560 transitions. Word has length 65 [2019-12-18 23:55:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:04,065 INFO L462 AbstractCegarLoop]: Abstraction has 21214 states and 63560 transitions. [2019-12-18 23:55:04,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:55:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 21214 states and 63560 transitions. [2019-12-18 23:55:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 23:55:04,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:04,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-18 23:55:04,071 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:04,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:04,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1895278566, now seen corresponding path program 1 times [2019-12-18 23:55:04,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:04,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431660763] [2019-12-18 23:55:04,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:04,171 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-18 23:55:04,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431660763] [2019-12-18 23:55:04,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:04,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:55:04,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827899422] [2019-12-18 23:55:04,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:55:04,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:04,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:55:04,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:55:04,174 INFO L87 Difference]: Start difference. First operand 21214 states and 63560 transitions. Second operand 6 states. [2019-12-18 23:55:04,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:04,876 INFO L93 Difference]: Finished difference Result 30326 states and 89100 transitions. [2019-12-18 23:55:04,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 23:55:04,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 23:55:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:04,955 INFO L225 Difference]: With dead ends: 30326 [2019-12-18 23:55:04,955 INFO L226 Difference]: Without dead ends: 30278 [2019-12-18 23:55:04,955 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-18 23:55:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30278 states. [2019-12-18 23:55:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30278 to 27631. [2019-12-18 23:55:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27631 states. [2019-12-18 23:55:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 81447 transitions. [2019-12-18 23:55:06,583 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 81447 transitions. Word has length 65 [2019-12-18 23:55:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:06,583 INFO L462 AbstractCegarLoop]: Abstraction has 27631 states and 81447 transitions. [2019-12-18 23:55:06,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:55:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 81447 transitions. [2019-12-18 23:55:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 23:55:06,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:06,593 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-18 23:55:06,594 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:06,594 INFO L82 PathProgramCache]: Analyzing trace with hash -279598761, now seen corresponding path program 1 times [2019-12-18 23:55:06,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:06,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286645390] [2019-12-18 23:55:06,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:06,638 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-18 23:55:06,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286645390] [2019-12-18 23:55:06,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:06,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:55:06,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4168559] [2019-12-18 23:55:06,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:55:06,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:55:06,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:55:06,640 INFO L87 Difference]: Start difference. First operand 27631 states and 81447 transitions. Second operand 3 states. [2019-12-18 23:55:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:06,804 INFO L93 Difference]: Finished difference Result 30274 states and 87661 transitions. [2019-12-18 23:55:06,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:55:06,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-18 23:55:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:06,847 INFO L225 Difference]: With dead ends: 30274 [2019-12-18 23:55:06,847 INFO L226 Difference]: Without dead ends: 30274 [2019-12-18 23:55:06,847 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-18 23:55:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30274 states. [2019-12-18 23:55:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30274 to 26779. [2019-12-18 23:55:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26779 states. [2019-12-18 23:55:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26779 states to 26779 states and 76975 transitions. [2019-12-18 23:55:07,219 INFO L78 Accepts]: Start accepts. Automaton has 26779 states and 76975 transitions. Word has length 71 [2019-12-18 23:55:07,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:07,220 INFO L462 AbstractCegarLoop]: Abstraction has 26779 states and 76975 transitions. [2019-12-18 23:55:07,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:55:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 26779 states and 76975 transitions. [2019-12-18 23:55:07,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 23:55:07,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:07,230 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-18 23:55:07,231 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:07,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:07,231 INFO L82 PathProgramCache]: Analyzing trace with hash 214408150, now seen corresponding path program 1 times [2019-12-18 23:55:07,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:07,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902867812] [2019-12-18 23:55:07,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:07,297 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-18 23:55:07,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902867812] [2019-12-18 23:55:07,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:07,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:55:07,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329569664] [2019-12-18 23:55:07,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:55:07,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:07,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:55:07,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:55:07,300 INFO L87 Difference]: Start difference. First operand 26779 states and 76975 transitions. Second operand 4 states. [2019-12-18 23:55:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:08,059 INFO L93 Difference]: Finished difference Result 35101 states and 101171 transitions. [2019-12-18 23:55:08,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:55:08,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-18 23:55:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:08,110 INFO L225 Difference]: With dead ends: 35101 [2019-12-18 23:55:08,110 INFO L226 Difference]: Without dead ends: 34678 [2019-12-18 23:55:08,111 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-18 23:55:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34678 states. [2019-12-18 23:55:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34678 to 32875. [2019-12-18 23:55:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32875 states. [2019-12-18 23:55:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32875 states to 32875 states and 94659 transitions. [2019-12-18 23:55:10,240 INFO L78 Accepts]: Start accepts. Automaton has 32875 states and 94659 transitions. Word has length 73 [2019-12-18 23:55:10,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:10,240 INFO L462 AbstractCegarLoop]: Abstraction has 32875 states and 94659 transitions. [2019-12-18 23:55:10,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:55:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 32875 states and 94659 transitions. [2019-12-18 23:55:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 23:55:10,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:10,253 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-18 23:55:10,253 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:10,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1582543209, now seen corresponding path program 1 times [2019-12-18 23:55:10,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:10,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540768030] [2019-12-18 23:55:10,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:10,343 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-18 23:55:10,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540768030] [2019-12-18 23:55:10,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:10,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:55:10,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461349918] [2019-12-18 23:55:10,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:55:10,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:10,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:55:10,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:55:10,346 INFO L87 Difference]: Start difference. First operand 32875 states and 94659 transitions. Second operand 7 states. [2019-12-18 23:55:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:11,208 INFO L93 Difference]: Finished difference Result 46954 states and 134687 transitions. [2019-12-18 23:55:11,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:55:11,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-18 23:55:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:11,299 INFO L225 Difference]: With dead ends: 46954 [2019-12-18 23:55:11,300 INFO L226 Difference]: Without dead ends: 46954 [2019-12-18 23:55:11,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:55:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46954 states. [2019-12-18 23:55:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46954 to 38263. [2019-12-18 23:55:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38263 states. [2019-12-18 23:55:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38263 states to 38263 states and 110017 transitions. [2019-12-18 23:55:11,839 INFO L78 Accepts]: Start accepts. Automaton has 38263 states and 110017 transitions. Word has length 73 [2019-12-18 23:55:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:11,839 INFO L462 AbstractCegarLoop]: Abstraction has 38263 states and 110017 transitions. [2019-12-18 23:55:11,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:55:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 38263 states and 110017 transitions. [2019-12-18 23:55:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 23:55:11,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:11,856 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-18 23:55:11,856 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:11,857 INFO L82 PathProgramCache]: Analyzing trace with hash -695039528, now seen corresponding path program 1 times [2019-12-18 23:55:11,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:11,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903060274] [2019-12-18 23:55:11,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:12,214 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-18 23:55:12,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903060274] [2019-12-18 23:55:12,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:12,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:55:12,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126566900] [2019-12-18 23:55:12,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:55:12,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:55:12,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:55:12,219 INFO L87 Difference]: Start difference. First operand 38263 states and 110017 transitions. Second operand 5 states. [2019-12-18 23:55:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:12,286 INFO L93 Difference]: Finished difference Result 10492 states and 26178 transitions. [2019-12-18 23:55:12,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:55:12,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-18 23:55:12,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:12,296 INFO L225 Difference]: With dead ends: 10492 [2019-12-18 23:55:12,296 INFO L226 Difference]: Without dead ends: 9187 [2019-12-18 23:55:12,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:55:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9187 states. [2019-12-18 23:55:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9187 to 7132. [2019-12-18 23:55:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7132 states. [2019-12-18 23:55:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7132 states to 7132 states and 17788 transitions. [2019-12-18 23:55:12,381 INFO L78 Accepts]: Start accepts. Automaton has 7132 states and 17788 transitions. Word has length 73 [2019-12-18 23:55:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:12,381 INFO L462 AbstractCegarLoop]: Abstraction has 7132 states and 17788 transitions. [2019-12-18 23:55:12,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:55:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 7132 states and 17788 transitions. [2019-12-18 23:55:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-18 23:55:12,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:12,388 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-18 23:55:12,388 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:12,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1925903749, now seen corresponding path program 1 times [2019-12-18 23:55:12,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:12,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958623846] [2019-12-18 23:55:12,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:12,458 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-18 23:55:12,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958623846] [2019-12-18 23:55:12,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:12,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:55:12,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285128230] [2019-12-18 23:55:12,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:55:12,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:12,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:55:12,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:55:12,460 INFO L87 Difference]: Start difference. First operand 7132 states and 17788 transitions. Second operand 4 states. [2019-12-18 23:55:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:12,717 INFO L93 Difference]: Finished difference Result 8324 states and 20383 transitions. [2019-12-18 23:55:12,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:55:12,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-18 23:55:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:12,729 INFO L225 Difference]: With dead ends: 8324 [2019-12-18 23:55:12,729 INFO L226 Difference]: Without dead ends: 8324 [2019-12-18 23:55:12,730 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-18 23:55:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8324 states. [2019-12-18 23:55:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8324 to 7754. [2019-12-18 23:55:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7754 states. [2019-12-18 23:55:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7754 states to 7754 states and 19140 transitions. [2019-12-18 23:55:12,864 INFO L78 Accepts]: Start accepts. Automaton has 7754 states and 19140 transitions. Word has length 102 [2019-12-18 23:55:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:12,864 INFO L462 AbstractCegarLoop]: Abstraction has 7754 states and 19140 transitions. [2019-12-18 23:55:12,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:55:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 7754 states and 19140 transitions. [2019-12-18 23:55:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-18 23:55:12,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:12,874 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-18 23:55:12,874 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:12,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1124299066, now seen corresponding path program 1 times [2019-12-18 23:55:12,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:12,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673878074] [2019-12-18 23:55:12,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:13,020 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-18 23:55:13,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673878074] [2019-12-18 23:55:13,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:13,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:55:13,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96094399] [2019-12-18 23:55:13,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:55:13,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:13,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:55:13,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:55:13,025 INFO L87 Difference]: Start difference. First operand 7754 states and 19140 transitions. Second operand 7 states. [2019-12-18 23:55:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:13,628 INFO L93 Difference]: Finished difference Result 12544 states and 29841 transitions. [2019-12-18 23:55:13,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:55:13,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-18 23:55:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:13,642 INFO L225 Difference]: With dead ends: 12544 [2019-12-18 23:55:13,642 INFO L226 Difference]: Without dead ends: 12461 [2019-12-18 23:55:13,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:55:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12461 states. [2019-12-18 23:55:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12461 to 10329. [2019-12-18 23:55:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10329 states. [2019-12-18 23:55:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10329 states to 10329 states and 24823 transitions. [2019-12-18 23:55:13,763 INFO L78 Accepts]: Start accepts. Automaton has 10329 states and 24823 transitions. Word has length 102 [2019-12-18 23:55:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:13,764 INFO L462 AbstractCegarLoop]: Abstraction has 10329 states and 24823 transitions. [2019-12-18 23:55:13,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:55:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand 10329 states and 24823 transitions. [2019-12-18 23:55:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-18 23:55:13,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:13,773 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-18 23:55:13,773 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1093458887, now seen corresponding path program 1 times [2019-12-18 23:55:13,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:13,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438175800] [2019-12-18 23:55:13,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:13,902 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-18 23:55:13,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438175800] [2019-12-18 23:55:13,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:13,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:55:13,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703756466] [2019-12-18 23:55:13,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:55:13,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:55:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:55:13,904 INFO L87 Difference]: Start difference. First operand 10329 states and 24823 transitions. Second operand 7 states. [2019-12-18 23:55:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:14,552 INFO L93 Difference]: Finished difference Result 13683 states and 31530 transitions. [2019-12-18 23:55:14,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:55:14,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-18 23:55:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:14,567 INFO L225 Difference]: With dead ends: 13683 [2019-12-18 23:55:14,567 INFO L226 Difference]: Without dead ends: 13683 [2019-12-18 23:55:14,567 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-18 23:55:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13683 states. [2019-12-18 23:55:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13683 to 11433. [2019-12-18 23:55:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11433 states. [2019-12-18 23:55:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11433 states to 11433 states and 26695 transitions. [2019-12-18 23:55:14,707 INFO L78 Accepts]: Start accepts. Automaton has 11433 states and 26695 transitions. Word has length 102 [2019-12-18 23:55:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:14,707 INFO L462 AbstractCegarLoop]: Abstraction has 11433 states and 26695 transitions. [2019-12-18 23:55:14,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:55:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 11433 states and 26695 transitions. [2019-12-18 23:55:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-18 23:55:14,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:14,719 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-18 23:55:14,719 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1304809800, now seen corresponding path program 1 times [2019-12-18 23:55:14,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:14,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9294828] [2019-12-18 23:55:14,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:14,800 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-18 23:55:14,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9294828] [2019-12-18 23:55:14,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:14,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:55:14,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270273288] [2019-12-18 23:55:14,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:55:14,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:14,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:55:14,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:55:14,802 INFO L87 Difference]: Start difference. First operand 11433 states and 26695 transitions. Second operand 7 states. [2019-12-18 23:55:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:15,843 INFO L93 Difference]: Finished difference Result 16428 states and 38221 transitions. [2019-12-18 23:55:15,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:55:15,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-18 23:55:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:15,874 INFO L225 Difference]: With dead ends: 16428 [2019-12-18 23:55:15,875 INFO L226 Difference]: Without dead ends: 16428 [2019-12-18 23:55:15,875 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-18 23:55:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16428 states. [2019-12-18 23:55:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16428 to 14321. [2019-12-18 23:55:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14321 states. [2019-12-18 23:55:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14321 states to 14321 states and 33515 transitions. [2019-12-18 23:55:16,204 INFO L78 Accepts]: Start accepts. Automaton has 14321 states and 33515 transitions. Word has length 102 [2019-12-18 23:55:16,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:16,205 INFO L462 AbstractCegarLoop]: Abstraction has 14321 states and 33515 transitions. [2019-12-18 23:55:16,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:55:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 14321 states and 33515 transitions. [2019-12-18 23:55:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-18 23:55:16,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:16,230 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-18 23:55:16,230 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1890179417, now seen corresponding path program 1 times [2019-12-18 23:55:16,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:16,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856097343] [2019-12-18 23:55:16,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:16,421 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-18 23:55:16,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856097343] [2019-12-18 23:55:16,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:16,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:55:16,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383518677] [2019-12-18 23:55:16,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:55:16,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:16,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:55:16,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:55:16,425 INFO L87 Difference]: Start difference. First operand 14321 states and 33515 transitions. Second operand 7 states. [2019-12-18 23:55:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:16,859 INFO L93 Difference]: Finished difference Result 15188 states and 35324 transitions. [2019-12-18 23:55:16,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:55:16,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-12-18 23:55:16,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:16,886 INFO L225 Difference]: With dead ends: 15188 [2019-12-18 23:55:16,886 INFO L226 Difference]: Without dead ends: 15188 [2019-12-18 23:55:16,886 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-18 23:55:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15188 states. [2019-12-18 23:55:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15188 to 12233. [2019-12-18 23:55:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12233 states. [2019-12-18 23:55:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12233 states to 12233 states and 28587 transitions. [2019-12-18 23:55:17,121 INFO L78 Accepts]: Start accepts. Automaton has 12233 states and 28587 transitions. Word has length 102 [2019-12-18 23:55:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:17,122 INFO L462 AbstractCegarLoop]: Abstraction has 12233 states and 28587 transitions. [2019-12-18 23:55:17,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:55:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 12233 states and 28587 transitions. [2019-12-18 23:55:17,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-18 23:55:17,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:17,138 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-18 23:55:17,138 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:17,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:17,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1002675736, now seen corresponding path program 1 times [2019-12-18 23:55:17,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:17,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754073286] [2019-12-18 23:55:17,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:17,202 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-18 23:55:17,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754073286] [2019-12-18 23:55:17,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:17,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:55:17,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521077457] [2019-12-18 23:55:17,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:55:17,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:17,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:55:17,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:55:17,207 INFO L87 Difference]: Start difference. First operand 12233 states and 28587 transitions. Second operand 3 states. [2019-12-18 23:55:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:17,284 INFO L93 Difference]: Finished difference Result 14866 states and 34744 transitions. [2019-12-18 23:55:17,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:55:17,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-12-18 23:55:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:17,315 INFO L225 Difference]: With dead ends: 14866 [2019-12-18 23:55:17,315 INFO L226 Difference]: Without dead ends: 14866 [2019-12-18 23:55:17,317 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-18 23:55:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14866 states. [2019-12-18 23:55:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14866 to 14807. [2019-12-18 23:55:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14807 states. [2019-12-18 23:55:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14807 states to 14807 states and 34616 transitions. [2019-12-18 23:55:17,655 INFO L78 Accepts]: Start accepts. Automaton has 14807 states and 34616 transitions. Word has length 102 [2019-12-18 23:55:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:17,656 INFO L462 AbstractCegarLoop]: Abstraction has 14807 states and 34616 transitions. [2019-12-18 23:55:17,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:55:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 14807 states and 34616 transitions. [2019-12-18 23:55:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-18 23:55:17,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:17,679 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-18 23:55:17,679 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash -651875799, now seen corresponding path program 1 times [2019-12-18 23:55:17,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:17,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930142810] [2019-12-18 23:55:17,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:17,839 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-18 23:55:17,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930142810] [2019-12-18 23:55:17,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:17,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:55:17,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115490426] [2019-12-18 23:55:17,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:55:17,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:17,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:55:17,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:55:17,841 INFO L87 Difference]: Start difference. First operand 14807 states and 34616 transitions. Second operand 4 states. [2019-12-18 23:55:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:18,239 INFO L93 Difference]: Finished difference Result 15320 states and 35776 transitions. [2019-12-18 23:55:18,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:55:18,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-18 23:55:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:18,261 INFO L225 Difference]: With dead ends: 15320 [2019-12-18 23:55:18,262 INFO L226 Difference]: Without dead ends: 15320 [2019-12-18 23:55:18,262 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-18 23:55:18,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15320 states. [2019-12-18 23:55:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15320 to 14392. [2019-12-18 23:55:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14392 states. [2019-12-18 23:55:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14392 states to 14392 states and 33701 transitions. [2019-12-18 23:55:18,511 INFO L78 Accepts]: Start accepts. Automaton has 14392 states and 33701 transitions. Word has length 102 [2019-12-18 23:55:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:18,511 INFO L462 AbstractCegarLoop]: Abstraction has 14392 states and 33701 transitions. [2019-12-18 23:55:18,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:55:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 14392 states and 33701 transitions. [2019-12-18 23:55:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-18 23:55:18,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:18,536 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-18 23:55:18,536 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:18,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2072449441, now seen corresponding path program 2 times [2019-12-18 23:55:18,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:18,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674733782] [2019-12-18 23:55:18,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:18,636 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-18 23:55:18,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674733782] [2019-12-18 23:55:18,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:18,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:55:18,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144410138] [2019-12-18 23:55:18,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:55:18,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:18,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:55:18,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:55:18,639 INFO L87 Difference]: Start difference. First operand 14392 states and 33701 transitions. Second operand 5 states. [2019-12-18 23:55:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:19,233 INFO L93 Difference]: Finished difference Result 15460 states and 35992 transitions. [2019-12-18 23:55:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:55:19,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-12-18 23:55:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:19,255 INFO L225 Difference]: With dead ends: 15460 [2019-12-18 23:55:19,256 INFO L226 Difference]: Without dead ends: 15460 [2019-12-18 23:55:19,256 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-18 23:55:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15460 states. [2019-12-18 23:55:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15460 to 14358. [2019-12-18 23:55:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14358 states. [2019-12-18 23:55:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14358 states to 14358 states and 33565 transitions. [2019-12-18 23:55:19,481 INFO L78 Accepts]: Start accepts. Automaton has 14358 states and 33565 transitions. Word has length 102 [2019-12-18 23:55:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:19,482 INFO L462 AbstractCegarLoop]: Abstraction has 14358 states and 33565 transitions. [2019-12-18 23:55:19,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:55:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 14358 states and 33565 transitions. [2019-12-18 23:55:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-18 23:55:19,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:19,495 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-18 23:55:19,495 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1365477573, now seen corresponding path program 3 times [2019-12-18 23:55:19,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:19,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494577932] [2019-12-18 23:55:19,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:19,569 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-18 23:55:19,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494577932] [2019-12-18 23:55:19,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:19,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:55:19,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434822225] [2019-12-18 23:55:19,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:55:19,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:19,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:55:19,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:55:19,571 INFO L87 Difference]: Start difference. First operand 14358 states and 33565 transitions. Second operand 6 states. [2019-12-18 23:55:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:20,021 INFO L93 Difference]: Finished difference Result 17143 states and 39905 transitions. [2019-12-18 23:55:20,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:55:20,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-12-18 23:55:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:20,046 INFO L225 Difference]: With dead ends: 17143 [2019-12-18 23:55:20,047 INFO L226 Difference]: Without dead ends: 17143 [2019-12-18 23:55:20,047 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-18 23:55:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17143 states. [2019-12-18 23:55:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17143 to 14391. [2019-12-18 23:55:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14391 states. [2019-12-18 23:55:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14391 states to 14391 states and 33634 transitions. [2019-12-18 23:55:20,303 INFO L78 Accepts]: Start accepts. Automaton has 14391 states and 33634 transitions. Word has length 102 [2019-12-18 23:55:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:20,303 INFO L462 AbstractCegarLoop]: Abstraction has 14391 states and 33634 transitions. [2019-12-18 23:55:20,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:55:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 14391 states and 33634 transitions. [2019-12-18 23:55:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-18 23:55:20,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:20,324 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-18 23:55:20,324 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:20,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:20,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1022975161, now seen corresponding path program 4 times [2019-12-18 23:55:20,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:20,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492105332] [2019-12-18 23:55:20,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:20,383 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-18 23:55:20,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492105332] [2019-12-18 23:55:20,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:20,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:55:20,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711992187] [2019-12-18 23:55:20,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:55:20,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:20,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:55:20,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:55:20,385 INFO L87 Difference]: Start difference. First operand 14391 states and 33634 transitions. Second operand 5 states. [2019-12-18 23:55:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:20,708 INFO L93 Difference]: Finished difference Result 16259 states and 37443 transitions. [2019-12-18 23:55:20,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:55:20,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-12-18 23:55:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:20,728 INFO L225 Difference]: With dead ends: 16259 [2019-12-18 23:55:20,728 INFO L226 Difference]: Without dead ends: 16259 [2019-12-18 23:55:20,728 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-18 23:55:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16259 states. [2019-12-18 23:55:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16259 to 14594. [2019-12-18 23:55:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14594 states. [2019-12-18 23:55:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14594 states to 14594 states and 34053 transitions. [2019-12-18 23:55:20,905 INFO L78 Accepts]: Start accepts. Automaton has 14594 states and 34053 transitions. Word has length 102 [2019-12-18 23:55:20,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:20,905 INFO L462 AbstractCegarLoop]: Abstraction has 14594 states and 34053 transitions. [2019-12-18 23:55:20,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:55:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 14594 states and 34053 transitions. [2019-12-18 23:55:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-18 23:55:20,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:20,920 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-18 23:55:20,920 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1031663374, now seen corresponding path program 1 times [2019-12-18 23:55:20,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:20,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093206118] [2019-12-18 23:55:20,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:21,104 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-18 23:55:21,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093206118] [2019-12-18 23:55:21,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:21,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:55:21,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689931208] [2019-12-18 23:55:21,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:55:21,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:21,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:55:21,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:55:21,106 INFO L87 Difference]: Start difference. First operand 14594 states and 34053 transitions. Second operand 12 states. [2019-12-18 23:55:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:22,052 INFO L93 Difference]: Finished difference Result 25507 states and 58799 transitions. [2019-12-18 23:55:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 23:55:22,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 104 [2019-12-18 23:55:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:22,076 INFO L225 Difference]: With dead ends: 25507 [2019-12-18 23:55:22,076 INFO L226 Difference]: Without dead ends: 23245 [2019-12-18 23:55:22,076 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-18 23:55:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23245 states. [2019-12-18 23:55:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23245 to 18073. [2019-12-18 23:55:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18073 states. [2019-12-18 23:55:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18073 states to 18073 states and 42132 transitions. [2019-12-18 23:55:22,281 INFO L78 Accepts]: Start accepts. Automaton has 18073 states and 42132 transitions. Word has length 104 [2019-12-18 23:55:22,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:22,281 INFO L462 AbstractCegarLoop]: Abstraction has 18073 states and 42132 transitions. [2019-12-18 23:55:22,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:55:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 18073 states and 42132 transitions. [2019-12-18 23:55:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-18 23:55:22,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:22,298 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-18 23:55:22,298 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:22,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:22,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1268769222, now seen corresponding path program 1 times [2019-12-18 23:55:22,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:22,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782753992] [2019-12-18 23:55:22,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:22,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-18 23:55:22,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782753992] [2019-12-18 23:55:22,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:22,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 23:55:22,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858787802] [2019-12-18 23:55:22,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:55:22,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:22,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:55:22,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:55:22,434 INFO L87 Difference]: Start difference. First operand 18073 states and 42132 transitions. Second operand 8 states. [2019-12-18 23:55:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:22,560 INFO L93 Difference]: Finished difference Result 18546 states and 43178 transitions. [2019-12-18 23:55:22,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:55:22,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-12-18 23:55:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:22,565 INFO L225 Difference]: With dead ends: 18546 [2019-12-18 23:55:22,565 INFO L226 Difference]: Without dead ends: 2995 [2019-12-18 23:55:22,565 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-18 23:55:22,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-12-18 23:55:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2993. [2019-12-18 23:55:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2993 states. [2019-12-18 23:55:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 7025 transitions. [2019-12-18 23:55:22,591 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 7025 transitions. Word has length 104 [2019-12-18 23:55:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:22,591 INFO L462 AbstractCegarLoop]: Abstraction has 2993 states and 7025 transitions. [2019-12-18 23:55:22,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:55:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 7025 transitions. [2019-12-18 23:55:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-18 23:55:22,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:22,594 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-18 23:55:22,594 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:22,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1538969505, now seen corresponding path program 1 times [2019-12-18 23:55:22,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:22,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952169853] [2019-12-18 23:55:22,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:22,664 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-18 23:55:22,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952169853] [2019-12-18 23:55:22,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:22,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:55:22,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323977007] [2019-12-18 23:55:22,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:55:22,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:22,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:55:22,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:55:22,666 INFO L87 Difference]: Start difference. First operand 2993 states and 7025 transitions. Second operand 5 states. [2019-12-18 23:55:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:22,901 INFO L93 Difference]: Finished difference Result 3318 states and 7717 transitions. [2019-12-18 23:55:22,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:55:22,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-12-18 23:55:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:22,906 INFO L225 Difference]: With dead ends: 3318 [2019-12-18 23:55:22,906 INFO L226 Difference]: Without dead ends: 3296 [2019-12-18 23:55:22,907 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-18 23:55:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3296 states. [2019-12-18 23:55:22,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3296 to 3045. [2019-12-18 23:55:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3045 states. [2019-12-18 23:55:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 7141 transitions. [2019-12-18 23:55:22,934 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 7141 transitions. Word has length 104 [2019-12-18 23:55:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:22,934 INFO L462 AbstractCegarLoop]: Abstraction has 3045 states and 7141 transitions. [2019-12-18 23:55:22,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:55:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 7141 transitions. [2019-12-18 23:55:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-18 23:55:22,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:22,936 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-18 23:55:22,937 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:22,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:22,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1502982559, now seen corresponding path program 1 times [2019-12-18 23:55:22,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:22,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901226511] [2019-12-18 23:55:22,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:23,094 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-18 23:55:23,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901226511] [2019-12-18 23:55:23,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:23,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 23:55:23,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440496177] [2019-12-18 23:55:23,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:55:23,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:23,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:55:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:55:23,097 INFO L87 Difference]: Start difference. First operand 3045 states and 7141 transitions. Second operand 8 states. [2019-12-18 23:55:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:23,511 INFO L93 Difference]: Finished difference Result 3328 states and 7755 transitions. [2019-12-18 23:55:23,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 23:55:23,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-12-18 23:55:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:23,517 INFO L225 Difference]: With dead ends: 3328 [2019-12-18 23:55:23,517 INFO L226 Difference]: Without dead ends: 3328 [2019-12-18 23:55:23,521 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-18 23:55:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2019-12-18 23:55:23,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3033. [2019-12-18 23:55:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3033 states. [2019-12-18 23:55:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 7106 transitions. [2019-12-18 23:55:23,550 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 7106 transitions. Word has length 104 [2019-12-18 23:55:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:23,550 INFO L462 AbstractCegarLoop]: Abstraction has 3033 states and 7106 transitions. [2019-12-18 23:55:23,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:55:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 7106 transitions. [2019-12-18 23:55:23,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-18 23:55:23,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:23,553 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-18 23:55:23,553 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1904481056, now seen corresponding path program 1 times [2019-12-18 23:55:23,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:23,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872823132] [2019-12-18 23:55:23,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:23,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-18 23:55:23,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872823132] [2019-12-18 23:55:23,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:23,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:55:23,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666635615] [2019-12-18 23:55:23,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:55:23,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:23,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:55:23,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:55:23,645 INFO L87 Difference]: Start difference. First operand 3033 states and 7106 transitions. Second operand 7 states. [2019-12-18 23:55:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:23,920 INFO L93 Difference]: Finished difference Result 3400 states and 8037 transitions. [2019-12-18 23:55:23,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:55:23,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-12-18 23:55:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:23,925 INFO L225 Difference]: With dead ends: 3400 [2019-12-18 23:55:23,926 INFO L226 Difference]: Without dead ends: 3400 [2019-12-18 23:55:23,926 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-18 23:55:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2019-12-18 23:55:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 2975. [2019-12-18 23:55:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-12-18 23:55:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 6988 transitions. [2019-12-18 23:55:23,958 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 6988 transitions. Word has length 104 [2019-12-18 23:55:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:23,958 INFO L462 AbstractCegarLoop]: Abstraction has 2975 states and 6988 transitions. [2019-12-18 23:55:23,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:55:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 6988 transitions. [2019-12-18 23:55:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-18 23:55:23,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:23,961 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-18 23:55:23,961 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:23,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:23,961 INFO L82 PathProgramCache]: Analyzing trace with hash 636284413, now seen corresponding path program 1 times [2019-12-18 23:55:23,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:23,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063053576] [2019-12-18 23:55:23,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:55:24,089 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-18 23:55:24,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063053576] [2019-12-18 23:55:24,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:55:24,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:55:24,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51899735] [2019-12-18 23:55:24,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 23:55:24,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:55:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 23:55:24,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:55:24,092 INFO L87 Difference]: Start difference. First operand 2975 states and 6988 transitions. Second operand 11 states. [2019-12-18 23:55:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:55:24,562 INFO L93 Difference]: Finished difference Result 4758 states and 10888 transitions. [2019-12-18 23:55:24,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:55:24,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-12-18 23:55:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:55:24,569 INFO L225 Difference]: With dead ends: 4758 [2019-12-18 23:55:24,569 INFO L226 Difference]: Without dead ends: 3430 [2019-12-18 23:55:24,570 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-18 23:55:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2019-12-18 23:55:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3026. [2019-12-18 23:55:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3026 states. [2019-12-18 23:55:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 7043 transitions. [2019-12-18 23:55:24,626 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 7043 transitions. Word has length 104 [2019-12-18 23:55:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:55:24,627 INFO L462 AbstractCegarLoop]: Abstraction has 3026 states and 7043 transitions. [2019-12-18 23:55:24,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 23:55:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 7043 transitions. [2019-12-18 23:55:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-18 23:55:24,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:55:24,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:55:24,633 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:55:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:55:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash 586103867, now seen corresponding path program 2 times [2019-12-18 23:55:24,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:55:24,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770632999] [2019-12-18 23:55:24,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:55:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:55:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:55:24,832 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:55:24,833 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:55:25,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:55:25 BasicIcfg [2019-12-18 23:55:25,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:55:25,162 INFO L168 Benchmark]: Toolchain (without parser) took 146241.46 ms. Allocated memory was 146.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 23:55:25,162 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 23:55:25,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.95 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.1 MB in the beginning and 156.7 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-18 23:55:25,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.96 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 153.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 23:55:25,164 INFO L168 Benchmark]: Boogie Preprocessor took 43.04 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:55:25,165 INFO L168 Benchmark]: RCFGBuilder took 916.38 ms. Allocated memory is still 203.9 MB. Free memory was 150.9 MB in the beginning and 98.2 MB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:55:25,165 INFO L168 Benchmark]: TraceAbstraction took 144369.50 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 98.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 23:55:25,167 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.53 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.95 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.1 MB in the beginning and 156.7 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.96 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 153.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.04 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 916.38 ms. Allocated memory is still 203.9 MB. Free memory was 150.9 MB in the beginning and 98.2 MB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144369.50 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 98.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. 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 t0; 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(&t0, ((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 t1; 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(&t1, ((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: 143.8s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 45.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12062 SDtfs, 13394 SDslu, 31498 SDs, 0 SdLazy, 10044 SolverSat, 539 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 91 SyntacticMatches, 27 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.5s 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: 85.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 232553 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2688 NumberOfCodeBlocks, 2688 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2552 ConstructedInterpolants, 0 QuantifiedInterpolants, 559302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...