/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/safe034_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 05:30:30,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 05:30:30,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 05:30:30,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 05:30:30,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 05:30:30,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 05:30:30,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 05:30:30,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 05:30:30,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 05:30:30,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 05:30:30,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 05:30:30,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 05:30:30,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 05:30:30,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 05:30:30,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 05:30:30,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 05:30:30,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 05:30:30,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 05:30:30,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 05:30:30,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 05:30:30,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 05:30:30,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 05:30:30,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 05:30:30,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 05:30:30,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 05:30:30,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 05:30:30,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 05:30:30,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 05:30:30,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 05:30:30,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 05:30:30,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 05:30:30,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 05:30:30,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 05:30:30,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 05:30:30,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 05:30:30,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 05:30:30,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 05:30:30,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 05:30:30,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 05:30:30,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 05:30:30,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 05:30:30,972 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-19 05:30:30,987 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 05:30:30,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 05:30:30,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 05:30:30,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 05:30:30,989 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 05:30:30,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 05:30:30,989 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 05:30:30,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 05:30:30,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 05:30:30,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 05:30:30,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 05:30:30,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 05:30:30,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 05:30:30,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 05:30:30,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 05:30:30,991 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 05:30:30,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 05:30:30,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 05:30:30,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 05:30:30,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 05:30:30,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 05:30:30,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 05:30:30,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 05:30:30,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 05:30:30,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 05:30:30,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 05:30:30,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 05:30:30,993 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 05:30:30,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 05:30:30,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 05:30:31,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 05:30:31,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 05:30:31,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 05:30:31,281 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 05:30:31,281 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 05:30:31,282 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i [2019-12-19 05:30:31,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cff8f879/9be7482b08b2476ab28a24fa13cfe438/FLAG1cdcf448a [2019-12-19 05:30:31,933 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 05:30:31,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i [2019-12-19 05:30:31,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cff8f879/9be7482b08b2476ab28a24fa13cfe438/FLAG1cdcf448a [2019-12-19 05:30:32,184 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cff8f879/9be7482b08b2476ab28a24fa13cfe438 [2019-12-19 05:30:32,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 05:30:32,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 05:30:32,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 05:30:32,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 05:30:32,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 05:30:32,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:30:32" (1/1) ... [2019-12-19 05:30:32,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32, skipping insertion in model container [2019-12-19 05:30:32,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:30:32" (1/1) ... [2019-12-19 05:30:32,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 05:30:32,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 05:30:32,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:30:32,795 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 05:30:32,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:30:32,942 INFO L208 MainTranslator]: Completed translation [2019-12-19 05:30:32,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32 WrapperNode [2019-12-19 05:30:32,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 05:30:32,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 05:30:32,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 05:30:32,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 05:30:32,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32" (1/1) ... [2019-12-19 05:30:32,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32" (1/1) ... [2019-12-19 05:30:33,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 05:30:33,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 05:30:33,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 05:30:33,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 05:30:33,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32" (1/1) ... [2019-12-19 05:30:33,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32" (1/1) ... [2019-12-19 05:30:33,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32" (1/1) ... [2019-12-19 05:30:33,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32" (1/1) ... [2019-12-19 05:30:33,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32" (1/1) ... [2019-12-19 05:30:33,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32" (1/1) ... [2019-12-19 05:30:33,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32" (1/1) ... [2019-12-19 05:30:33,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 05:30:33,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 05:30:33,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 05:30:33,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 05:30:33,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32" (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-19 05:30:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 05:30:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 05:30:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 05:30:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 05:30:33,126 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 05:30:33,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 05:30:33,126 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 05:30:33,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 05:30:33,126 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-19 05:30:33,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-19 05:30:33,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 05:30:33,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 05:30:33,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 05:30:33,129 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 05:30:33,840 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 05:30:33,840 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 05:30:33,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:30:33 BoogieIcfgContainer [2019-12-19 05:30:33,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 05:30:33,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 05:30:33,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 05:30:33,847 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 05:30:33,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:30:32" (1/3) ... [2019-12-19 05:30:33,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4458bdd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:30:33, skipping insertion in model container [2019-12-19 05:30:33,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:30:32" (2/3) ... [2019-12-19 05:30:33,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4458bdd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:30:33, skipping insertion in model container [2019-12-19 05:30:33,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:30:33" (3/3) ... [2019-12-19 05:30:33,851 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc.i [2019-12-19 05:30:33,862 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 05:30:33,862 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 05:30:33,870 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 05:30:33,871 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 05:30:33,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,914 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,914 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,956 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,963 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,963 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,964 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:30:33,997 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-19 05:30:34,017 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 05:30:34,018 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 05:30:34,018 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 05:30:34,018 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 05:30:34,018 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 05:30:34,018 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 05:30:34,019 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 05:30:34,019 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 05:30:34,033 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 176 transitions [2019-12-19 05:30:53,214 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111186 states. [2019-12-19 05:30:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 111186 states. [2019-12-19 05:30:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 05:30:53,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:30:53,231 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] [2019-12-19 05:30:53,231 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:30:53,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:30:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1109224519, now seen corresponding path program 1 times [2019-12-19 05:30:53,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:30:53,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672432287] [2019-12-19 05:30:53,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:30:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:30:53,598 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-19 05:30:53,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672432287] [2019-12-19 05:30:53,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:30:53,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:30:53,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236818947] [2019-12-19 05:30:53,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:30:53,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:30:53,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:30:53,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:30:53,623 INFO L87 Difference]: Start difference. First operand 111186 states. Second operand 4 states. [2019-12-19 05:30:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:30:57,781 INFO L93 Difference]: Finished difference Result 114114 states and 522350 transitions. [2019-12-19 05:30:57,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:30:57,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-19 05:30:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:30:58,317 INFO L225 Difference]: With dead ends: 114114 [2019-12-19 05:30:58,317 INFO L226 Difference]: Without dead ends: 82834 [2019-12-19 05:30:58,319 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-19 05:30:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82834 states. [2019-12-19 05:31:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82834 to 82834. [2019-12-19 05:31:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82834 states. [2019-12-19 05:31:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82834 states to 82834 states and 380410 transitions. [2019-12-19 05:31:05,176 INFO L78 Accepts]: Start accepts. Automaton has 82834 states and 380410 transitions. Word has length 45 [2019-12-19 05:31:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:31:05,177 INFO L462 AbstractCegarLoop]: Abstraction has 82834 states and 380410 transitions. [2019-12-19 05:31:05,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:31:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 82834 states and 380410 transitions. [2019-12-19 05:31:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 05:31:05,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:31:05,196 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] [2019-12-19 05:31:05,196 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:31:05,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:31:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1958045590, now seen corresponding path program 1 times [2019-12-19 05:31:05,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:31:05,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198950952] [2019-12-19 05:31:05,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:31:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:31:05,335 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-19 05:31:05,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198950952] [2019-12-19 05:31:05,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:31:05,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:31:05,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183397500] [2019-12-19 05:31:05,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:31:05,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:31:05,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:31:05,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:31:05,341 INFO L87 Difference]: Start difference. First operand 82834 states and 380410 transitions. Second operand 5 states. [2019-12-19 05:31:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:31:10,737 INFO L93 Difference]: Finished difference Result 129234 states and 566702 transitions. [2019-12-19 05:31:10,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:31:10,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-19 05:31:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:31:11,361 INFO L225 Difference]: With dead ends: 129234 [2019-12-19 05:31:11,361 INFO L226 Difference]: Without dead ends: 126474 [2019-12-19 05:31:11,362 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-19 05:31:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126474 states. [2019-12-19 05:31:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126474 to 119958. [2019-12-19 05:31:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119958 states. [2019-12-19 05:31:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119958 states to 119958 states and 531549 transitions. [2019-12-19 05:31:15,168 INFO L78 Accepts]: Start accepts. Automaton has 119958 states and 531549 transitions. Word has length 53 [2019-12-19 05:31:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:31:15,168 INFO L462 AbstractCegarLoop]: Abstraction has 119958 states and 531549 transitions. [2019-12-19 05:31:15,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:31:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 119958 states and 531549 transitions. [2019-12-19 05:31:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 05:31:15,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:31:15,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:31:15,187 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:31:15,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:31:15,187 INFO L82 PathProgramCache]: Analyzing trace with hash 690713249, now seen corresponding path program 1 times [2019-12-19 05:31:15,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:31:15,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559013227] [2019-12-19 05:31:15,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:31:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:31:15,291 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-19 05:31:15,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559013227] [2019-12-19 05:31:15,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:31:15,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:31:15,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687661475] [2019-12-19 05:31:15,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:31:15,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:31:15,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:31:15,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:31:15,294 INFO L87 Difference]: Start difference. First operand 119958 states and 531549 transitions. Second operand 5 states. [2019-12-19 05:31:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:31:20,810 INFO L93 Difference]: Finished difference Result 156370 states and 680698 transitions. [2019-12-19 05:31:20,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:31:20,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-19 05:31:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:31:21,345 INFO L225 Difference]: With dead ends: 156370 [2019-12-19 05:31:21,346 INFO L226 Difference]: Without dead ends: 154130 [2019-12-19 05:31:21,346 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-19 05:31:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154130 states. [2019-12-19 05:31:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154130 to 132942. [2019-12-19 05:31:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132942 states. [2019-12-19 05:31:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132942 states to 132942 states and 585323 transitions. [2019-12-19 05:31:26,519 INFO L78 Accepts]: Start accepts. Automaton has 132942 states and 585323 transitions. Word has length 54 [2019-12-19 05:31:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:31:26,520 INFO L462 AbstractCegarLoop]: Abstraction has 132942 states and 585323 transitions. [2019-12-19 05:31:26,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:31:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 132942 states and 585323 transitions. [2019-12-19 05:31:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 05:31:26,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:31:26,545 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-19 05:31:26,545 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:31:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:31:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1060971801, now seen corresponding path program 1 times [2019-12-19 05:31:26,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:31:26,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431759523] [2019-12-19 05:31:26,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:31:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:31:26,597 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-19 05:31:26,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431759523] [2019-12-19 05:31:26,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:31:26,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:31:26,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690819533] [2019-12-19 05:31:26,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:31:26,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:31:26,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:31:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:31:26,600 INFO L87 Difference]: Start difference. First operand 132942 states and 585323 transitions. Second operand 3 states. [2019-12-19 05:31:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:31:33,057 INFO L93 Difference]: Finished difference Result 171274 states and 741340 transitions. [2019-12-19 05:31:33,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:31:33,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-19 05:31:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:31:33,621 INFO L225 Difference]: With dead ends: 171274 [2019-12-19 05:31:33,621 INFO L226 Difference]: Without dead ends: 171274 [2019-12-19 05:31:33,622 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-19 05:31:34,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171274 states. [2019-12-19 05:31:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171274 to 151998. [2019-12-19 05:31:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151998 states. [2019-12-19 05:31:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151998 states to 151998 states and 663351 transitions. [2019-12-19 05:31:38,986 INFO L78 Accepts]: Start accepts. Automaton has 151998 states and 663351 transitions. Word has length 56 [2019-12-19 05:31:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:31:38,986 INFO L462 AbstractCegarLoop]: Abstraction has 151998 states and 663351 transitions. [2019-12-19 05:31:38,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:31:38,987 INFO L276 IsEmpty]: Start isEmpty. Operand 151998 states and 663351 transitions. [2019-12-19 05:31:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:31:39,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:31:39,026 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] [2019-12-19 05:31:39,026 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:31:39,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:31:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1957923899, now seen corresponding path program 1 times [2019-12-19 05:31:39,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:31:39,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519802092] [2019-12-19 05:31:39,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:31:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:31:39,213 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-19 05:31:39,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519802092] [2019-12-19 05:31:39,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:31:39,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:31:39,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924681479] [2019-12-19 05:31:39,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:31:39,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:31:39,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:31:39,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:31:39,216 INFO L87 Difference]: Start difference. First operand 151998 states and 663351 transitions. Second operand 6 states. [2019-12-19 05:31:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:31:46,474 INFO L93 Difference]: Finished difference Result 208582 states and 902701 transitions. [2019-12-19 05:31:46,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:31:46,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-19 05:31:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:31:47,125 INFO L225 Difference]: With dead ends: 208582 [2019-12-19 05:31:47,125 INFO L226 Difference]: Without dead ends: 205382 [2019-12-19 05:31:47,126 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-19 05:31:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205382 states. [2019-12-19 05:31:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205382 to 193070. [2019-12-19 05:31:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193070 states. [2019-12-19 05:31:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193070 states to 193070 states and 837871 transitions. [2019-12-19 05:31:58,529 INFO L78 Accepts]: Start accepts. Automaton has 193070 states and 837871 transitions. Word has length 60 [2019-12-19 05:31:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:31:58,529 INFO L462 AbstractCegarLoop]: Abstraction has 193070 states and 837871 transitions. [2019-12-19 05:31:58,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:31:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 193070 states and 837871 transitions. [2019-12-19 05:31:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:31:59,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:31:59,547 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] [2019-12-19 05:31:59,547 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:31:59,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:31:59,547 INFO L82 PathProgramCache]: Analyzing trace with hash 540092038, now seen corresponding path program 1 times [2019-12-19 05:31:59,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:31:59,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163533303] [2019-12-19 05:31:59,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:31:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:31:59,683 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-19 05:31:59,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163533303] [2019-12-19 05:31:59,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:31:59,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:31:59,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422194660] [2019-12-19 05:31:59,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:31:59,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:31:59,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:31:59,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:31:59,685 INFO L87 Difference]: Start difference. First operand 193070 states and 837871 transitions. Second operand 7 states. [2019-12-19 05:32:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:03,431 INFO L93 Difference]: Finished difference Result 275526 states and 1157813 transitions. [2019-12-19 05:32:03,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:32:03,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-19 05:32:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:04,333 INFO L225 Difference]: With dead ends: 275526 [2019-12-19 05:32:04,333 INFO L226 Difference]: Without dead ends: 275526 [2019-12-19 05:32:04,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:32:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275526 states. [2019-12-19 05:32:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275526 to 228422. [2019-12-19 05:32:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228422 states. [2019-12-19 05:32:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228422 states to 228422 states and 972797 transitions. [2019-12-19 05:32:19,868 INFO L78 Accepts]: Start accepts. Automaton has 228422 states and 972797 transitions. Word has length 60 [2019-12-19 05:32:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:19,869 INFO L462 AbstractCegarLoop]: Abstraction has 228422 states and 972797 transitions. [2019-12-19 05:32:19,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:32:19,869 INFO L276 IsEmpty]: Start isEmpty. Operand 228422 states and 972797 transitions. [2019-12-19 05:32:19,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:32:19,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:19,919 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] [2019-12-19 05:32:19,919 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:19,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1427595719, now seen corresponding path program 1 times [2019-12-19 05:32:19,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:19,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798647029] [2019-12-19 05:32:19,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:19,994 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-19 05:32:19,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798647029] [2019-12-19 05:32:19,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:19,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:32:19,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220123331] [2019-12-19 05:32:19,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:32:19,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:19,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:32:19,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:32:19,996 INFO L87 Difference]: Start difference. First operand 228422 states and 972797 transitions. Second operand 4 states. [2019-12-19 05:32:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:27,530 INFO L93 Difference]: Finished difference Result 185894 states and 771106 transitions. [2019-12-19 05:32:27,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:32:27,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-19 05:32:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:28,069 INFO L225 Difference]: With dead ends: 185894 [2019-12-19 05:32:28,069 INFO L226 Difference]: Without dead ends: 180910 [2019-12-19 05:32:28,070 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-19 05:32:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180910 states. [2019-12-19 05:32:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180910 to 180910. [2019-12-19 05:32:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180910 states. [2019-12-19 05:32:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180910 states to 180910 states and 753597 transitions. [2019-12-19 05:32:33,481 INFO L78 Accepts]: Start accepts. Automaton has 180910 states and 753597 transitions. Word has length 60 [2019-12-19 05:32:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:33,481 INFO L462 AbstractCegarLoop]: Abstraction has 180910 states and 753597 transitions. [2019-12-19 05:32:33,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:32:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 180910 states and 753597 transitions. [2019-12-19 05:32:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:32:33,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:33,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:32:33,510 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:33,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1792364402, now seen corresponding path program 1 times [2019-12-19 05:32:33,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:33,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775514994] [2019-12-19 05:32:33,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:33,585 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-19 05:32:33,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775514994] [2019-12-19 05:32:33,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:33,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:32:33,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665902118] [2019-12-19 05:32:33,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:32:33,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:33,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:32:33,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:32:33,587 INFO L87 Difference]: Start difference. First operand 180910 states and 753597 transitions. Second operand 6 states. [2019-12-19 05:32:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:41,007 INFO L93 Difference]: Finished difference Result 234266 states and 959370 transitions. [2019-12-19 05:32:41,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:32:41,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-19 05:32:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:41,727 INFO L225 Difference]: With dead ends: 234266 [2019-12-19 05:32:41,728 INFO L226 Difference]: Without dead ends: 229388 [2019-12-19 05:32:41,728 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-19 05:32:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229388 states. [2019-12-19 05:32:47,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229388 to 183769. [2019-12-19 05:32:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183769 states. [2019-12-19 05:32:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183769 states to 183769 states and 765836 transitions. [2019-12-19 05:32:47,653 INFO L78 Accepts]: Start accepts. Automaton has 183769 states and 765836 transitions. Word has length 60 [2019-12-19 05:32:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:47,653 INFO L462 AbstractCegarLoop]: Abstraction has 183769 states and 765836 transitions. [2019-12-19 05:32:47,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:32:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 183769 states and 765836 transitions. [2019-12-19 05:32:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 05:32:47,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:47,687 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] [2019-12-19 05:32:47,687 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2025804751, now seen corresponding path program 1 times [2019-12-19 05:32:47,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:47,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363919075] [2019-12-19 05:32:47,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:48,904 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-19 05:32:48,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363919075] [2019-12-19 05:32:48,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:48,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:32:48,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863322042] [2019-12-19 05:32:48,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:32:48,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:48,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:32:48,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:32:48,907 INFO L87 Difference]: Start difference. First operand 183769 states and 765836 transitions. Second operand 5 states. [2019-12-19 05:32:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:49,211 INFO L93 Difference]: Finished difference Result 34882 states and 130106 transitions. [2019-12-19 05:32:49,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:32:49,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-19 05:32:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:49,297 INFO L225 Difference]: With dead ends: 34882 [2019-12-19 05:32:49,298 INFO L226 Difference]: Without dead ends: 30055 [2019-12-19 05:32:49,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:32:49,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30055 states. [2019-12-19 05:32:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30055 to 29863. [2019-12-19 05:32:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29863 states. [2019-12-19 05:32:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29863 states to 29863 states and 110396 transitions. [2019-12-19 05:32:49,846 INFO L78 Accepts]: Start accepts. Automaton has 29863 states and 110396 transitions. Word has length 61 [2019-12-19 05:32:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:49,846 INFO L462 AbstractCegarLoop]: Abstraction has 29863 states and 110396 transitions. [2019-12-19 05:32:49,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:32:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 29863 states and 110396 transitions. [2019-12-19 05:32:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 05:32:49,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:49,862 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-19 05:32:49,862 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:49,862 INFO L82 PathProgramCache]: Analyzing trace with hash -565208698, now seen corresponding path program 1 times [2019-12-19 05:32:49,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:49,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894659196] [2019-12-19 05:32:49,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:49,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-19 05:32:49,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894659196] [2019-12-19 05:32:49,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:49,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:32:49,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434484893] [2019-12-19 05:32:49,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:32:49,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:49,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:32:49,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:32:49,924 INFO L87 Difference]: Start difference. First operand 29863 states and 110396 transitions. Second operand 4 states. [2019-12-19 05:32:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:50,170 INFO L93 Difference]: Finished difference Result 34924 states and 128758 transitions. [2019-12-19 05:32:50,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:32:50,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-19 05:32:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:50,245 INFO L225 Difference]: With dead ends: 34924 [2019-12-19 05:32:50,245 INFO L226 Difference]: Without dead ends: 34924 [2019-12-19 05:32:50,246 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-19 05:32:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34924 states. [2019-12-19 05:32:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34924 to 31801. [2019-12-19 05:32:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31801 states. [2019-12-19 05:32:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31801 states to 31801 states and 117322 transitions. [2019-12-19 05:32:53,316 INFO L78 Accepts]: Start accepts. Automaton has 31801 states and 117322 transitions. Word has length 71 [2019-12-19 05:32:53,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:53,316 INFO L462 AbstractCegarLoop]: Abstraction has 31801 states and 117322 transitions. [2019-12-19 05:32:53,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:32:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 31801 states and 117322 transitions. [2019-12-19 05:32:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 05:32:53,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:53,333 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-19 05:32:53,333 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1177601637, now seen corresponding path program 1 times [2019-12-19 05:32:53,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:53,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158569955] [2019-12-19 05:32:53,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:53,416 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-19 05:32:53,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158569955] [2019-12-19 05:32:53,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:53,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:32:53,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946613358] [2019-12-19 05:32:53,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:32:53,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:53,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:32:53,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:32:53,418 INFO L87 Difference]: Start difference. First operand 31801 states and 117322 transitions. Second operand 6 states. [2019-12-19 05:32:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:54,041 INFO L93 Difference]: Finished difference Result 40977 states and 149241 transitions. [2019-12-19 05:32:54,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 05:32:54,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 05:32:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:54,123 INFO L225 Difference]: With dead ends: 40977 [2019-12-19 05:32:54,123 INFO L226 Difference]: Without dead ends: 40797 [2019-12-19 05:32:54,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-19 05:32:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40797 states. [2019-12-19 05:32:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40797 to 34292. [2019-12-19 05:32:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34292 states. [2019-12-19 05:32:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34292 states to 34292 states and 125836 transitions. [2019-12-19 05:32:55,172 INFO L78 Accepts]: Start accepts. Automaton has 34292 states and 125836 transitions. Word has length 71 [2019-12-19 05:32:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:55,173 INFO L462 AbstractCegarLoop]: Abstraction has 34292 states and 125836 transitions. [2019-12-19 05:32:55,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:32:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 34292 states and 125836 transitions. [2019-12-19 05:32:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 05:32:55,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:55,193 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-19 05:32:55,193 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:55,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1556409345, now seen corresponding path program 1 times [2019-12-19 05:32:55,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:55,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154996303] [2019-12-19 05:32:55,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:55,262 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-19 05:32:55,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154996303] [2019-12-19 05:32:55,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:55,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:32:55,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582183047] [2019-12-19 05:32:55,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:32:55,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:55,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:32:55,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:32:55,265 INFO L87 Difference]: Start difference. First operand 34292 states and 125836 transitions. Second operand 4 states. [2019-12-19 05:32:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:55,673 INFO L93 Difference]: Finished difference Result 43210 states and 156685 transitions. [2019-12-19 05:32:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:32:55,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-19 05:32:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:55,814 INFO L225 Difference]: With dead ends: 43210 [2019-12-19 05:32:55,814 INFO L226 Difference]: Without dead ends: 43210 [2019-12-19 05:32:55,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:32:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43210 states. [2019-12-19 05:32:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43210 to 39520. [2019-12-19 05:32:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39520 states. [2019-12-19 05:32:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39520 states to 39520 states and 143617 transitions. [2019-12-19 05:32:56,935 INFO L78 Accepts]: Start accepts. Automaton has 39520 states and 143617 transitions. Word has length 73 [2019-12-19 05:32:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:56,935 INFO L462 AbstractCegarLoop]: Abstraction has 39520 states and 143617 transitions. [2019-12-19 05:32:56,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:32:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 39520 states and 143617 transitions. [2019-12-19 05:32:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 05:32:56,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:56,979 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-19 05:32:56,979 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:56,979 INFO L82 PathProgramCache]: Analyzing trace with hash -520799998, now seen corresponding path program 1 times [2019-12-19 05:32:56,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:56,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996248684] [2019-12-19 05:32:56,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:57,034 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-19 05:32:57,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996248684] [2019-12-19 05:32:57,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:57,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:32:57,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746924866] [2019-12-19 05:32:57,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:32:57,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:57,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:32:57,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:32:57,037 INFO L87 Difference]: Start difference. First operand 39520 states and 143617 transitions. Second operand 3 states. [2019-12-19 05:32:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:57,838 INFO L93 Difference]: Finished difference Result 41333 states and 149658 transitions. [2019-12-19 05:32:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:32:57,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-19 05:32:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:57,958 INFO L225 Difference]: With dead ends: 41333 [2019-12-19 05:32:57,958 INFO L226 Difference]: Without dead ends: 41333 [2019-12-19 05:32:57,959 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-19 05:32:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41333 states. [2019-12-19 05:32:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41333 to 40522. [2019-12-19 05:32:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40522 states. [2019-12-19 05:32:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40522 states to 40522 states and 146939 transitions. [2019-12-19 05:32:58,703 INFO L78 Accepts]: Start accepts. Automaton has 40522 states and 146939 transitions. Word has length 73 [2019-12-19 05:32:58,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:32:58,704 INFO L462 AbstractCegarLoop]: Abstraction has 40522 states and 146939 transitions. [2019-12-19 05:32:58,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:32:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 40522 states and 146939 transitions. [2019-12-19 05:32:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:32:58,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:32:58,744 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] [2019-12-19 05:32:58,745 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:32:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:32:58,745 INFO L82 PathProgramCache]: Analyzing trace with hash 239718800, now seen corresponding path program 1 times [2019-12-19 05:32:58,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:32:58,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671321454] [2019-12-19 05:32:58,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:32:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:32:58,878 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-19 05:32:58,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671321454] [2019-12-19 05:32:58,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:32:58,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:32:58,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336487029] [2019-12-19 05:32:58,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:32:58,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:32:58,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:32:58,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:32:58,881 INFO L87 Difference]: Start difference. First operand 40522 states and 146939 transitions. Second operand 6 states. [2019-12-19 05:32:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:32:59,893 INFO L93 Difference]: Finished difference Result 45111 states and 161731 transitions. [2019-12-19 05:32:59,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:32:59,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-19 05:32:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:32:59,986 INFO L225 Difference]: With dead ends: 45111 [2019-12-19 05:32:59,986 INFO L226 Difference]: Without dead ends: 45111 [2019-12-19 05:32:59,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:33:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45111 states. [2019-12-19 05:33:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45111 to 43398. [2019-12-19 05:33:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43398 states. [2019-12-19 05:33:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43398 states to 43398 states and 156062 transitions. [2019-12-19 05:33:00,716 INFO L78 Accepts]: Start accepts. Automaton has 43398 states and 156062 transitions. Word has length 75 [2019-12-19 05:33:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:00,716 INFO L462 AbstractCegarLoop]: Abstraction has 43398 states and 156062 transitions. [2019-12-19 05:33:00,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:33:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 43398 states and 156062 transitions. [2019-12-19 05:33:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:33:00,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:00,755 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] [2019-12-19 05:33:00,755 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:00,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1837490543, now seen corresponding path program 1 times [2019-12-19 05:33:00,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:00,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597647007] [2019-12-19 05:33:00,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:00,862 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-19 05:33:00,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597647007] [2019-12-19 05:33:00,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:00,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:33:00,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146374241] [2019-12-19 05:33:00,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:33:00,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:00,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:33:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:33:00,864 INFO L87 Difference]: Start difference. First operand 43398 states and 156062 transitions. Second operand 6 states. [2019-12-19 05:33:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:01,496 INFO L93 Difference]: Finished difference Result 51187 states and 179497 transitions. [2019-12-19 05:33:01,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:33:01,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-19 05:33:01,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:01,618 INFO L225 Difference]: With dead ends: 51187 [2019-12-19 05:33:01,619 INFO L226 Difference]: Without dead ends: 51187 [2019-12-19 05:33:01,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:33:01,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51187 states. [2019-12-19 05:33:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51187 to 45430. [2019-12-19 05:33:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45430 states. [2019-12-19 05:33:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45430 states to 45430 states and 160426 transitions. [2019-12-19 05:33:02,712 INFO L78 Accepts]: Start accepts. Automaton has 45430 states and 160426 transitions. Word has length 75 [2019-12-19 05:33:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:02,712 INFO L462 AbstractCegarLoop]: Abstraction has 45430 states and 160426 transitions. [2019-12-19 05:33:02,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:33:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 45430 states and 160426 transitions. [2019-12-19 05:33:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:33:02,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:02,746 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] [2019-12-19 05:33:02,746 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:02,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1626139630, now seen corresponding path program 1 times [2019-12-19 05:33:02,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:02,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742564346] [2019-12-19 05:33:02,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:02,811 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-19 05:33:02,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742564346] [2019-12-19 05:33:02,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:02,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:33:02,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012890143] [2019-12-19 05:33:02,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:33:02,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:02,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:33:02,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:33:02,816 INFO L87 Difference]: Start difference. First operand 45430 states and 160426 transitions. Second operand 5 states. [2019-12-19 05:33:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:03,396 INFO L93 Difference]: Finished difference Result 57019 states and 200691 transitions. [2019-12-19 05:33:03,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:33:03,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-19 05:33:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:03,554 INFO L225 Difference]: With dead ends: 57019 [2019-12-19 05:33:03,554 INFO L226 Difference]: Without dead ends: 57019 [2019-12-19 05:33:03,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:33:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57019 states. [2019-12-19 05:33:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57019 to 49069. [2019-12-19 05:33:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49069 states. [2019-12-19 05:33:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49069 states to 49069 states and 172037 transitions. [2019-12-19 05:33:04,720 INFO L78 Accepts]: Start accepts. Automaton has 49069 states and 172037 transitions. Word has length 75 [2019-12-19 05:33:04,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:04,720 INFO L462 AbstractCegarLoop]: Abstraction has 49069 states and 172037 transitions. [2019-12-19 05:33:04,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:33:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 49069 states and 172037 transitions. [2019-12-19 05:33:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:33:04,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:04,757 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] [2019-12-19 05:33:04,757 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:04,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:04,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2136673807, now seen corresponding path program 1 times [2019-12-19 05:33:04,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:04,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935270179] [2019-12-19 05:33:04,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:04,830 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-19 05:33:04,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935270179] [2019-12-19 05:33:04,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:04,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:33:04,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882072175] [2019-12-19 05:33:04,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:33:04,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:33:04,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:33:04,832 INFO L87 Difference]: Start difference. First operand 49069 states and 172037 transitions. Second operand 5 states. [2019-12-19 05:33:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:05,476 INFO L93 Difference]: Finished difference Result 64393 states and 225636 transitions. [2019-12-19 05:33:05,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:33:05,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-19 05:33:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:05,637 INFO L225 Difference]: With dead ends: 64393 [2019-12-19 05:33:05,638 INFO L226 Difference]: Without dead ends: 64393 [2019-12-19 05:33:05,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:33:05,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64393 states. [2019-12-19 05:33:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64393 to 51957. [2019-12-19 05:33:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51957 states. [2019-12-19 05:33:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51957 states to 51957 states and 182151 transitions. [2019-12-19 05:33:06,950 INFO L78 Accepts]: Start accepts. Automaton has 51957 states and 182151 transitions. Word has length 75 [2019-12-19 05:33:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:06,950 INFO L462 AbstractCegarLoop]: Abstraction has 51957 states and 182151 transitions. [2019-12-19 05:33:06,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:33:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 51957 states and 182151 transitions. [2019-12-19 05:33:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:33:06,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:06,984 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] [2019-12-19 05:33:06,985 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:06,986 INFO L82 PathProgramCache]: Analyzing trace with hash 350839026, now seen corresponding path program 1 times [2019-12-19 05:33:06,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:06,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675328963] [2019-12-19 05:33:06,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:07,100 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-19 05:33:07,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675328963] [2019-12-19 05:33:07,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:07,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:33:07,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678204856] [2019-12-19 05:33:07,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:33:07,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:07,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:33:07,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:33:07,102 INFO L87 Difference]: Start difference. First operand 51957 states and 182151 transitions. Second operand 6 states. [2019-12-19 05:33:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:07,383 INFO L93 Difference]: Finished difference Result 49842 states and 167712 transitions. [2019-12-19 05:33:07,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:33:07,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-19 05:33:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:07,474 INFO L225 Difference]: With dead ends: 49842 [2019-12-19 05:33:07,475 INFO L226 Difference]: Without dead ends: 49842 [2019-12-19 05:33:07,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:33:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49842 states. [2019-12-19 05:33:08,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49842 to 36559. [2019-12-19 05:33:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36559 states. [2019-12-19 05:33:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36559 states to 36559 states and 123944 transitions. [2019-12-19 05:33:08,540 INFO L78 Accepts]: Start accepts. Automaton has 36559 states and 123944 transitions. Word has length 75 [2019-12-19 05:33:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:08,540 INFO L462 AbstractCegarLoop]: Abstraction has 36559 states and 123944 transitions. [2019-12-19 05:33:08,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:33:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 36559 states and 123944 transitions. [2019-12-19 05:33:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 05:33:08,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:08,565 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] [2019-12-19 05:33:08,565 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash -558608652, now seen corresponding path program 1 times [2019-12-19 05:33:08,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:08,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775413954] [2019-12-19 05:33:08,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:08,651 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-19 05:33:08,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775413954] [2019-12-19 05:33:08,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:08,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:33:08,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904558072] [2019-12-19 05:33:08,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:33:08,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:33:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:33:08,653 INFO L87 Difference]: Start difference. First operand 36559 states and 123944 transitions. Second operand 6 states. [2019-12-19 05:33:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:08,761 INFO L93 Difference]: Finished difference Result 13933 states and 42710 transitions. [2019-12-19 05:33:08,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:33:08,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-19 05:33:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:08,778 INFO L225 Difference]: With dead ends: 13933 [2019-12-19 05:33:08,778 INFO L226 Difference]: Without dead ends: 12115 [2019-12-19 05:33:08,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:33:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12115 states. [2019-12-19 05:33:08,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12115 to 10863. [2019-12-19 05:33:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10863 states. [2019-12-19 05:33:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10863 states to 10863 states and 33106 transitions. [2019-12-19 05:33:08,920 INFO L78 Accepts]: Start accepts. Automaton has 10863 states and 33106 transitions. Word has length 75 [2019-12-19 05:33:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:08,921 INFO L462 AbstractCegarLoop]: Abstraction has 10863 states and 33106 transitions. [2019-12-19 05:33:08,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:33:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 10863 states and 33106 transitions. [2019-12-19 05:33:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:33:08,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:08,933 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] [2019-12-19 05:33:08,933 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:08,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:08,933 INFO L82 PathProgramCache]: Analyzing trace with hash -11366195, now seen corresponding path program 1 times [2019-12-19 05:33:08,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:08,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453099664] [2019-12-19 05:33:08,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:09,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453099664] [2019-12-19 05:33:09,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:09,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:33:09,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315539817] [2019-12-19 05:33:09,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:33:09,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:09,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:33:09,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:33:09,033 INFO L87 Difference]: Start difference. First operand 10863 states and 33106 transitions. Second operand 7 states. [2019-12-19 05:33:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:09,680 INFO L93 Difference]: Finished difference Result 13181 states and 39872 transitions. [2019-12-19 05:33:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 05:33:09,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:33:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:09,701 INFO L225 Difference]: With dead ends: 13181 [2019-12-19 05:33:09,701 INFO L226 Difference]: Without dead ends: 13109 [2019-12-19 05:33:09,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:33:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13109 states. [2019-12-19 05:33:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13109 to 11471. [2019-12-19 05:33:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11471 states. [2019-12-19 05:33:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11471 states to 11471 states and 34890 transitions. [2019-12-19 05:33:09,858 INFO L78 Accepts]: Start accepts. Automaton has 11471 states and 34890 transitions. Word has length 92 [2019-12-19 05:33:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:09,858 INFO L462 AbstractCegarLoop]: Abstraction has 11471 states and 34890 transitions. [2019-12-19 05:33:09,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:33:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 11471 states and 34890 transitions. [2019-12-19 05:33:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:33:09,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:09,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:33:09,870 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:09,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2088575538, now seen corresponding path program 1 times [2019-12-19 05:33:09,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:09,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383044591] [2019-12-19 05:33:09,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:09,993 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-19 05:33:09,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383044591] [2019-12-19 05:33:09,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:09,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:33:09,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629187635] [2019-12-19 05:33:09,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:33:09,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:09,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:33:09,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:33:09,995 INFO L87 Difference]: Start difference. First operand 11471 states and 34890 transitions. Second operand 7 states. [2019-12-19 05:33:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:10,120 INFO L93 Difference]: Finished difference Result 18947 states and 57202 transitions. [2019-12-19 05:33:10,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:33:10,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:33:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:10,140 INFO L225 Difference]: With dead ends: 18947 [2019-12-19 05:33:10,141 INFO L226 Difference]: Without dead ends: 10295 [2019-12-19 05:33:10,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:33:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10295 states. [2019-12-19 05:33:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10295 to 10295. [2019-12-19 05:33:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10295 states. [2019-12-19 05:33:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10295 states to 10295 states and 31128 transitions. [2019-12-19 05:33:10,288 INFO L78 Accepts]: Start accepts. Automaton has 10295 states and 31128 transitions. Word has length 92 [2019-12-19 05:33:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:10,289 INFO L462 AbstractCegarLoop]: Abstraction has 10295 states and 31128 transitions. [2019-12-19 05:33:10,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:33:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 10295 states and 31128 transitions. [2019-12-19 05:33:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:33:10,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:10,300 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] [2019-12-19 05:33:10,300 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1620378800, now seen corresponding path program 2 times [2019-12-19 05:33:10,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:10,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685575442] [2019-12-19 05:33:10,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:33:10,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685575442] [2019-12-19 05:33:10,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:10,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 05:33:10,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178887777] [2019-12-19 05:33:10,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 05:33:10,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:10,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 05:33:10,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:33:10,447 INFO L87 Difference]: Start difference. First operand 10295 states and 31128 transitions. Second operand 10 states. [2019-12-19 05:33:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:11,215 INFO L93 Difference]: Finished difference Result 28393 states and 86366 transitions. [2019-12-19 05:33:11,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-19 05:33:11,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-12-19 05:33:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:11,248 INFO L225 Difference]: With dead ends: 28393 [2019-12-19 05:33:11,248 INFO L226 Difference]: Without dead ends: 20995 [2019-12-19 05:33:11,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-19 05:33:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20995 states. [2019-12-19 05:33:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20995 to 11781. [2019-12-19 05:33:11,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11781 states. [2019-12-19 05:33:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11781 states to 11781 states and 34696 transitions. [2019-12-19 05:33:11,543 INFO L78 Accepts]: Start accepts. Automaton has 11781 states and 34696 transitions. Word has length 92 [2019-12-19 05:33:11,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:11,544 INFO L462 AbstractCegarLoop]: Abstraction has 11781 states and 34696 transitions. [2019-12-19 05:33:11,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 05:33:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 11781 states and 34696 transitions. [2019-12-19 05:33:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:33:11,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:11,558 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] [2019-12-19 05:33:11,558 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:11,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:11,559 INFO L82 PathProgramCache]: Analyzing trace with hash 380772358, now seen corresponding path program 3 times [2019-12-19 05:33:11,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:11,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532449811] [2019-12-19 05:33:11,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:33:11,721 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-19 05:33:11,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532449811] [2019-12-19 05:33:11,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:33:11,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 05:33:11,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691712974] [2019-12-19 05:33:11,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 05:33:11,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:33:11,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 05:33:11,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-19 05:33:11,724 INFO L87 Difference]: Start difference. First operand 11781 states and 34696 transitions. Second operand 11 states. [2019-12-19 05:33:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:33:12,357 INFO L93 Difference]: Finished difference Result 22835 states and 67497 transitions. [2019-12-19 05:33:12,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 05:33:12,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-12-19 05:33:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:33:12,384 INFO L225 Difference]: With dead ends: 22835 [2019-12-19 05:33:12,384 INFO L226 Difference]: Without dead ends: 18932 [2019-12-19 05:33:12,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-12-19 05:33:12,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18932 states. [2019-12-19 05:33:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18932 to 10709. [2019-12-19 05:33:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10709 states. [2019-12-19 05:33:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10709 states to 10709 states and 32134 transitions. [2019-12-19 05:33:12,578 INFO L78 Accepts]: Start accepts. Automaton has 10709 states and 32134 transitions. Word has length 92 [2019-12-19 05:33:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:33:12,579 INFO L462 AbstractCegarLoop]: Abstraction has 10709 states and 32134 transitions. [2019-12-19 05:33:12,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 05:33:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 10709 states and 32134 transitions. [2019-12-19 05:33:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:33:12,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:33:12,592 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] [2019-12-19 05:33:12,592 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:33:12,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:33:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1218439478, now seen corresponding path program 4 times [2019-12-19 05:33:12,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:33:12,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53403714] [2019-12-19 05:33:12,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:33:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:33:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:33:12,679 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 05:33:12,679 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 05:33:12,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:33:12 BasicIcfg [2019-12-19 05:33:12,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 05:33:12,875 INFO L168 Benchmark]: Toolchain (without parser) took 160678.05 ms. Allocated memory was 137.9 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.2 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-19 05:33:12,876 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-19 05:33:12,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.29 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 156.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-19 05:33:12,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.70 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 05:33:12,878 INFO L168 Benchmark]: Boogie Preprocessor took 37.37 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 05:33:12,879 INFO L168 Benchmark]: RCFGBuilder took 797.21 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 108.8 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 7.1 GB. [2019-12-19 05:33:12,886 INFO L168 Benchmark]: TraceAbstraction took 159027.46 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 108.1 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-19 05:33:12,888 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.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 745.29 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 156.2 MB in the end (delta: -55.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.70 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.37 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.21 ms. Allocated memory is still 201.9 MB. Free memory was 151.5 MB in the beginning and 108.8 MB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159027.46 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 108.1 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L701] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L703] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L705] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L706] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L707] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L708] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L709] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L710] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L711] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L712] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L713] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L714] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L715] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2577; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2578; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2579; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 3 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 z = 2 [L734] 1 __unbuffered_p0_EAX = x [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 y = y$flush_delayed ? y$mem_tmp : y [L764] 2 y$flush_delayed = (_Bool)0 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 158.6s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 61.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6933 SDtfs, 8638 SDslu, 18819 SDs, 0 SdLazy, 4788 SolverSat, 380 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228422occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 72.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 227802 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1707 NumberOfCodeBlocks, 1707 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1592 ConstructedInterpolants, 0 QuantifiedInterpolants, 343139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...