/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:59:17,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:59:17,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:59:17,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:59:17,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:59:17,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:59:17,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:59:17,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:59:17,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:59:17,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:59:17,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:59:17,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:59:17,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:59:17,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:59:17,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:59:17,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:59:17,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:59:17,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:59:17,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:59:17,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:59:17,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:59:17,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:59:17,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:59:17,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:59:17,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:59:17,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:59:17,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:59:17,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:59:17,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:59:17,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:59:17,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:59:17,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:59:17,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:59:17,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:59:17,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:59:17,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:59:17,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:59:17,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:59:17,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:59:17,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:59:17,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:59:17,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 08:59:17,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:59:17,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:59:17,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:59:17,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:59:17,939 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:59:17,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:59:17,939 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:59:17,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:59:17,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:59:17,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:59:17,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:59:17,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:59:17,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:59:17,940 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:59:17,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:59:17,941 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:59:17,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:59:17,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:59:17,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:59:17,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:59:17,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:59:17,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:59:17,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:59:17,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:59:17,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:59:17,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:59:17,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:59:17,943 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 08:59:17,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:59:17,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:59:18,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:59:18,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:59:18,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:59:18,240 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:59:18,240 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:59:18,241 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-27 08:59:18,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a11bc313/ef9e1b3738804359a0efe9dd24ab0630/FLAG61b77e713 [2019-12-27 08:59:18,868 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:59:18,869 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-27 08:59:18,889 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a11bc313/ef9e1b3738804359a0efe9dd24ab0630/FLAG61b77e713 [2019-12-27 08:59:19,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a11bc313/ef9e1b3738804359a0efe9dd24ab0630 [2019-12-27 08:59:19,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:59:19,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:59:19,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:59:19,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:59:19,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:59:19,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:59:19" (1/1) ... [2019-12-27 08:59:19,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0c9cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19, skipping insertion in model container [2019-12-27 08:59:19,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:59:19" (1/1) ... [2019-12-27 08:59:19,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:59:19,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:59:19,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:59:19,782 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:59:19,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:59:19,929 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:59:19,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19 WrapperNode [2019-12-27 08:59:19,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:59:19,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:59:19,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:59:19,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:59:19,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19" (1/1) ... [2019-12-27 08:59:19,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19" (1/1) ... [2019-12-27 08:59:19,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:59:19,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:59:19,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:59:20,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:59:20,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19" (1/1) ... [2019-12-27 08:59:20,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19" (1/1) ... [2019-12-27 08:59:20,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19" (1/1) ... [2019-12-27 08:59:20,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19" (1/1) ... [2019-12-27 08:59:20,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19" (1/1) ... [2019-12-27 08:59:20,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19" (1/1) ... [2019-12-27 08:59:20,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19" (1/1) ... [2019-12-27 08:59:20,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:59:20,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:59:20,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:59:20,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:59:20,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:59:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:59:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:59:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:59:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:59:20,140 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:59:20,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:59:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:59:20,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:59:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:59:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:59:20,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:59:20,145 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:59:21,140 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:59:21,140 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:59:21,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:59:21 BoogieIcfgContainer [2019-12-27 08:59:21,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:59:21,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:59:21,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:59:21,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:59:21,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:59:19" (1/3) ... [2019-12-27 08:59:21,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcef170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:59:21, skipping insertion in model container [2019-12-27 08:59:21,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:19" (2/3) ... [2019-12-27 08:59:21,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcef170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:59:21, skipping insertion in model container [2019-12-27 08:59:21,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:59:21" (3/3) ... [2019-12-27 08:59:21,151 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_rmo.oepc.i [2019-12-27 08:59:21,159 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:59:21,159 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:59:21,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:59:21,167 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:59:21,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,226 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,226 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,226 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,227 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,253 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,254 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,289 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,290 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,294 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:59:21,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 08:59:21,329 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:59:21,329 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:59:21,330 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:59:21,330 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:59:21,330 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:59:21,330 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:59:21,330 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:59:21,330 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:59:21,344 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 191 places, 246 transitions [2019-12-27 08:59:33,681 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100969 states. [2019-12-27 08:59:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 100969 states. [2019-12-27 08:59:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 08:59:33,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:59:33,691 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] [2019-12-27 08:59:33,692 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:59:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:59:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1867003899, now seen corresponding path program 1 times [2019-12-27 08:59:33,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:59:33,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354813803] [2019-12-27 08:59:33,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:59:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:59:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:59:33,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354813803] [2019-12-27 08:59:33,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:59:33,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:59:33,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413005785] [2019-12-27 08:59:33,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:59:33,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:59:34,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:59:34,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:59:34,011 INFO L87 Difference]: Start difference. First operand 100969 states. Second operand 4 states. [2019-12-27 08:59:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:59:35,438 INFO L93 Difference]: Finished difference Result 101969 states and 411474 transitions. [2019-12-27 08:59:35,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:59:35,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-27 08:59:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:59:36,022 INFO L225 Difference]: With dead ends: 101969 [2019-12-27 08:59:36,023 INFO L226 Difference]: Without dead ends: 74593 [2019-12-27 08:59:36,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:59:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74593 states. [2019-12-27 08:59:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74593 to 74593. [2019-12-27 08:59:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74593 states. [2019-12-27 08:59:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74593 states to 74593 states and 304546 transitions. [2019-12-27 08:59:42,987 INFO L78 Accepts]: Start accepts. Automaton has 74593 states and 304546 transitions. Word has length 36 [2019-12-27 08:59:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:59:42,987 INFO L462 AbstractCegarLoop]: Abstraction has 74593 states and 304546 transitions. [2019-12-27 08:59:42,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:59:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 74593 states and 304546 transitions. [2019-12-27 08:59:42,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 08:59:42,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:59:42,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:59:42,998 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:59:42,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:59:42,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1051219315, now seen corresponding path program 1 times [2019-12-27 08:59:42,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:59:42,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470095182] [2019-12-27 08:59:42,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:59:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:59:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:59:43,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470095182] [2019-12-27 08:59:43,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:59:43,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:59:43,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200567256] [2019-12-27 08:59:43,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:59:43,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:59:43,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:59:43,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:59:43,149 INFO L87 Difference]: Start difference. First operand 74593 states and 304546 transitions. Second operand 5 states. [2019-12-27 08:59:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:59:48,222 INFO L93 Difference]: Finished difference Result 121639 states and 464551 transitions. [2019-12-27 08:59:48,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:59:48,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-27 08:59:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:59:48,778 INFO L225 Difference]: With dead ends: 121639 [2019-12-27 08:59:48,778 INFO L226 Difference]: Without dead ends: 121103 [2019-12-27 08:59:48,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:59:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121103 states. [2019-12-27 08:59:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121103 to 119213. [2019-12-27 08:59:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119213 states. [2019-12-27 08:59:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119213 states to 119213 states and 456891 transitions. [2019-12-27 08:59:57,382 INFO L78 Accepts]: Start accepts. Automaton has 119213 states and 456891 transitions. Word has length 48 [2019-12-27 08:59:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:59:57,385 INFO L462 AbstractCegarLoop]: Abstraction has 119213 states and 456891 transitions. [2019-12-27 08:59:57,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:59:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 119213 states and 456891 transitions. [2019-12-27 08:59:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 08:59:57,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:59:57,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:59:57,393 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:59:57,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:59:57,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1611122121, now seen corresponding path program 1 times [2019-12-27 08:59:57,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:59:57,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433182922] [2019-12-27 08:59:57,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:59:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:59:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:59:57,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433182922] [2019-12-27 08:59:57,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:59:57,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:59:57,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568036163] [2019-12-27 08:59:57,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:59:57,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:59:57,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:59:57,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:59:57,495 INFO L87 Difference]: Start difference. First operand 119213 states and 456891 transitions. Second operand 5 states. [2019-12-27 08:59:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:59:58,722 INFO L93 Difference]: Finished difference Result 149065 states and 560747 transitions. [2019-12-27 08:59:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 08:59:58,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-27 08:59:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:59:59,186 INFO L225 Difference]: With dead ends: 149065 [2019-12-27 08:59:59,186 INFO L226 Difference]: Without dead ends: 148561 [2019-12-27 08:59:59,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:00:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148561 states. [2019-12-27 09:00:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148561 to 131878. [2019-12-27 09:00:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131878 states. [2019-12-27 09:00:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131878 states to 131878 states and 501408 transitions. [2019-12-27 09:00:08,641 INFO L78 Accepts]: Start accepts. Automaton has 131878 states and 501408 transitions. Word has length 49 [2019-12-27 09:00:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:08,642 INFO L462 AbstractCegarLoop]: Abstraction has 131878 states and 501408 transitions. [2019-12-27 09:00:08,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:00:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 131878 states and 501408 transitions. [2019-12-27 09:00:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 09:00:08,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:08,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:00:08,655 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1163539633, now seen corresponding path program 1 times [2019-12-27 09:00:08,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:08,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822702599] [2019-12-27 09:00:08,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:08,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-27 09:00:08,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822702599] [2019-12-27 09:00:08,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:08,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:00:08,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187660988] [2019-12-27 09:00:08,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:00:08,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:08,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:00:08,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:00:08,724 INFO L87 Difference]: Start difference. First operand 131878 states and 501408 transitions. Second operand 3 states. [2019-12-27 09:00:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:14,111 INFO L93 Difference]: Finished difference Result 226103 states and 838073 transitions. [2019-12-27 09:00:14,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:00:14,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 09:00:14,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:14,800 INFO L225 Difference]: With dead ends: 226103 [2019-12-27 09:00:14,800 INFO L226 Difference]: Without dead ends: 226103 [2019-12-27 09:00:14,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:00:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226103 states. [2019-12-27 09:00:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226103 to 201720. [2019-12-27 09:00:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201720 states. [2019-12-27 09:00:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201720 states to 201720 states and 750697 transitions. [2019-12-27 09:00:22,772 INFO L78 Accepts]: Start accepts. Automaton has 201720 states and 750697 transitions. Word has length 51 [2019-12-27 09:00:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:22,773 INFO L462 AbstractCegarLoop]: Abstraction has 201720 states and 750697 transitions. [2019-12-27 09:00:22,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:00:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 201720 states and 750697 transitions. [2019-12-27 09:00:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 09:00:22,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:22,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:00:22,804 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:22,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:22,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1032930122, now seen corresponding path program 1 times [2019-12-27 09:00:22,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:22,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061320708] [2019-12-27 09:00:22,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:00:22,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061320708] [2019-12-27 09:00:22,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:22,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:00:22,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286086357] [2019-12-27 09:00:22,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:00:22,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:22,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:00:22,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:00:22,990 INFO L87 Difference]: Start difference. First operand 201720 states and 750697 transitions. Second operand 6 states. [2019-12-27 09:00:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:30,772 INFO L93 Difference]: Finished difference Result 257719 states and 956292 transitions. [2019-12-27 09:00:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:00:30,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 09:00:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:31,443 INFO L225 Difference]: With dead ends: 257719 [2019-12-27 09:00:31,444 INFO L226 Difference]: Without dead ends: 257719 [2019-12-27 09:00:31,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:00:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257719 states. [2019-12-27 09:00:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257719 to 241036. [2019-12-27 09:00:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241036 states. [2019-12-27 09:00:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241036 states to 241036 states and 894179 transitions. [2019-12-27 09:00:40,299 INFO L78 Accepts]: Start accepts. Automaton has 241036 states and 894179 transitions. Word has length 55 [2019-12-27 09:00:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:00:40,300 INFO L462 AbstractCegarLoop]: Abstraction has 241036 states and 894179 transitions. [2019-12-27 09:00:40,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:00:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 241036 states and 894179 transitions. [2019-12-27 09:00:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 09:00:40,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:00:40,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:00:40,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:00:40,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:00:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1465085815, now seen corresponding path program 1 times [2019-12-27 09:00:40,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:00:40,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280266577] [2019-12-27 09:00:40,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:00:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:00:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:00:40,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280266577] [2019-12-27 09:00:40,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:00:40,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:00:40,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209936478] [2019-12-27 09:00:40,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:00:40,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:00:40,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:00:40,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:00:40,472 INFO L87 Difference]: Start difference. First operand 241036 states and 894179 transitions. Second operand 7 states. [2019-12-27 09:00:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:00:49,700 INFO L93 Difference]: Finished difference Result 334522 states and 1202846 transitions. [2019-12-27 09:00:49,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:00:49,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 09:00:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:00:51,314 INFO L225 Difference]: With dead ends: 334522 [2019-12-27 09:00:51,314 INFO L226 Difference]: Without dead ends: 334522 [2019-12-27 09:00:51,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:00:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334522 states. [2019-12-27 09:01:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334522 to 278543. [2019-12-27 09:01:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278543 states. [2019-12-27 09:01:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278543 states to 278543 states and 1017057 transitions. [2019-12-27 09:01:07,302 INFO L78 Accepts]: Start accepts. Automaton has 278543 states and 1017057 transitions. Word has length 55 [2019-12-27 09:01:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:07,302 INFO L462 AbstractCegarLoop]: Abstraction has 278543 states and 1017057 transitions. [2019-12-27 09:01:07,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:01:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 278543 states and 1017057 transitions. [2019-12-27 09:01:07,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 09:01:07,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:07,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:01:07,327 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1942377800, now seen corresponding path program 1 times [2019-12-27 09:01:07,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:07,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47620806] [2019-12-27 09:01:07,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:07,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47620806] [2019-12-27 09:01:07,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:07,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:01:07,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650556878] [2019-12-27 09:01:07,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:01:07,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:07,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:01:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:01:07,420 INFO L87 Difference]: Start difference. First operand 278543 states and 1017057 transitions. Second operand 4 states. [2019-12-27 09:01:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:07,614 INFO L93 Difference]: Finished difference Result 34538 states and 108800 transitions. [2019-12-27 09:01:07,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:01:07,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-27 09:01:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:07,669 INFO L225 Difference]: With dead ends: 34538 [2019-12-27 09:01:07,670 INFO L226 Difference]: Without dead ends: 26989 [2019-12-27 09:01:07,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:01:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26989 states. [2019-12-27 09:01:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26989 to 26730. [2019-12-27 09:01:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26730 states. [2019-12-27 09:01:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26730 states to 26730 states and 81037 transitions. [2019-12-27 09:01:08,030 INFO L78 Accepts]: Start accepts. Automaton has 26730 states and 81037 transitions. Word has length 55 [2019-12-27 09:01:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:08,030 INFO L462 AbstractCegarLoop]: Abstraction has 26730 states and 81037 transitions. [2019-12-27 09:01:08,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:01:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 26730 states and 81037 transitions. [2019-12-27 09:01:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 09:01:08,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:08,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:01:08,035 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:08,035 INFO L82 PathProgramCache]: Analyzing trace with hash -125662630, now seen corresponding path program 1 times [2019-12-27 09:01:08,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:08,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422083371] [2019-12-27 09:01:08,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:08,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422083371] [2019-12-27 09:01:08,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:08,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:01:08,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886492837] [2019-12-27 09:01:08,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:01:08,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:01:08,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:01:08,110 INFO L87 Difference]: Start difference. First operand 26730 states and 81037 transitions. Second operand 6 states. [2019-12-27 09:01:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:08,872 INFO L93 Difference]: Finished difference Result 31474 states and 93784 transitions. [2019-12-27 09:01:08,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 09:01:08,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 09:01:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:08,918 INFO L225 Difference]: With dead ends: 31474 [2019-12-27 09:01:08,918 INFO L226 Difference]: Without dead ends: 31411 [2019-12-27 09:01:08,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 09:01:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31411 states. [2019-12-27 09:01:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31411 to 26773. [2019-12-27 09:01:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26773 states. [2019-12-27 09:01:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26773 states to 26773 states and 81115 transitions. [2019-12-27 09:01:11,435 INFO L78 Accepts]: Start accepts. Automaton has 26773 states and 81115 transitions. Word has length 55 [2019-12-27 09:01:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:11,435 INFO L462 AbstractCegarLoop]: Abstraction has 26773 states and 81115 transitions. [2019-12-27 09:01:11,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:01:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 26773 states and 81115 transitions. [2019-12-27 09:01:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 09:01:11,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:11,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:01:11,441 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1986032310, now seen corresponding path program 1 times [2019-12-27 09:01:11,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:11,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783794906] [2019-12-27 09:01:11,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:11,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783794906] [2019-12-27 09:01:11,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:11,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:01:11,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444279245] [2019-12-27 09:01:11,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:01:11,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:11,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:01:11,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:01:11,508 INFO L87 Difference]: Start difference. First operand 26773 states and 81115 transitions. Second operand 4 states. [2019-12-27 09:01:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:11,798 INFO L93 Difference]: Finished difference Result 31358 states and 94804 transitions. [2019-12-27 09:01:11,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:01:11,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-27 09:01:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:11,843 INFO L225 Difference]: With dead ends: 31358 [2019-12-27 09:01:11,843 INFO L226 Difference]: Without dead ends: 31358 [2019-12-27 09:01:11,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:01:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31358 states. [2019-12-27 09:01:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31358 to 30491. [2019-12-27 09:01:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30491 states. [2019-12-27 09:01:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30491 states to 30491 states and 92276 transitions. [2019-12-27 09:01:12,284 INFO L78 Accepts]: Start accepts. Automaton has 30491 states and 92276 transitions. Word has length 63 [2019-12-27 09:01:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:12,285 INFO L462 AbstractCegarLoop]: Abstraction has 30491 states and 92276 transitions. [2019-12-27 09:01:12,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:01:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 30491 states and 92276 transitions. [2019-12-27 09:01:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 09:01:12,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:12,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:01:12,291 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash -566124651, now seen corresponding path program 1 times [2019-12-27 09:01:12,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:12,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8342086] [2019-12-27 09:01:12,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:12,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8342086] [2019-12-27 09:01:12,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:12,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:01:12,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049680634] [2019-12-27 09:01:12,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:01:12,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:12,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:01:12,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:01:12,435 INFO L87 Difference]: Start difference. First operand 30491 states and 92276 transitions. Second operand 6 states. [2019-12-27 09:01:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:13,181 INFO L93 Difference]: Finished difference Result 38026 states and 112750 transitions. [2019-12-27 09:01:13,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 09:01:13,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-27 09:01:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:13,553 INFO L225 Difference]: With dead ends: 38026 [2019-12-27 09:01:13,553 INFO L226 Difference]: Without dead ends: 37965 [2019-12-27 09:01:13,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:01:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37965 states. [2019-12-27 09:01:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37965 to 37190. [2019-12-27 09:01:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37190 states. [2019-12-27 09:01:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37190 states to 37190 states and 110476 transitions. [2019-12-27 09:01:14,008 INFO L78 Accepts]: Start accepts. Automaton has 37190 states and 110476 transitions. Word has length 63 [2019-12-27 09:01:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:14,008 INFO L462 AbstractCegarLoop]: Abstraction has 37190 states and 110476 transitions. [2019-12-27 09:01:14,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:01:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 37190 states and 110476 transitions. [2019-12-27 09:01:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 09:01:14,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:14,018 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] [2019-12-27 09:01:14,018 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:14,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:14,018 INFO L82 PathProgramCache]: Analyzing trace with hash -69430682, now seen corresponding path program 1 times [2019-12-27 09:01:14,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:14,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158444784] [2019-12-27 09:01:14,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:14,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158444784] [2019-12-27 09:01:14,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:14,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:01:14,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105774257] [2019-12-27 09:01:14,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:01:14,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:14,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:01:14,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:01:14,055 INFO L87 Difference]: Start difference. First operand 37190 states and 110476 transitions. Second operand 3 states. [2019-12-27 09:01:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:14,234 INFO L93 Difference]: Finished difference Result 45764 states and 134210 transitions. [2019-12-27 09:01:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:01:14,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-27 09:01:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:14,298 INFO L225 Difference]: With dead ends: 45764 [2019-12-27 09:01:14,298 INFO L226 Difference]: Without dead ends: 45764 [2019-12-27 09:01:14,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:01:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45764 states. [2019-12-27 09:01:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45764 to 37996. [2019-12-27 09:01:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37996 states. [2019-12-27 09:01:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37996 states to 37996 states and 110505 transitions. [2019-12-27 09:01:15,244 INFO L78 Accepts]: Start accepts. Automaton has 37996 states and 110505 transitions. Word has length 69 [2019-12-27 09:01:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:15,244 INFO L462 AbstractCegarLoop]: Abstraction has 37996 states and 110505 transitions. [2019-12-27 09:01:15,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:01:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 37996 states and 110505 transitions. [2019-12-27 09:01:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 09:01:15,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:15,259 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-27 09:01:15,259 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:15,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:15,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1005746969, now seen corresponding path program 1 times [2019-12-27 09:01:15,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:15,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859084997] [2019-12-27 09:01:15,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:15,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859084997] [2019-12-27 09:01:15,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:15,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:01:15,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918653648] [2019-12-27 09:01:15,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:01:15,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:15,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:01:15,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:01:15,323 INFO L87 Difference]: Start difference. First operand 37996 states and 110505 transitions. Second operand 5 states. [2019-12-27 09:01:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:15,781 INFO L93 Difference]: Finished difference Result 43056 states and 125055 transitions. [2019-12-27 09:01:15,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:01:15,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-27 09:01:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:15,840 INFO L225 Difference]: With dead ends: 43056 [2019-12-27 09:01:15,840 INFO L226 Difference]: Without dead ends: 43056 [2019-12-27 09:01:15,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:01:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43056 states. [2019-12-27 09:01:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43056 to 38407. [2019-12-27 09:01:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38407 states. [2019-12-27 09:01:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38407 states to 38407 states and 111610 transitions. [2019-12-27 09:01:16,345 INFO L78 Accepts]: Start accepts. Automaton has 38407 states and 111610 transitions. Word has length 75 [2019-12-27 09:01:16,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:16,346 INFO L462 AbstractCegarLoop]: Abstraction has 38407 states and 111610 transitions. [2019-12-27 09:01:16,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:01:16,346 INFO L276 IsEmpty]: Start isEmpty. Operand 38407 states and 111610 transitions. [2019-12-27 09:01:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 09:01:16,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:16,357 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-27 09:01:16,358 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1546409992, now seen corresponding path program 1 times [2019-12-27 09:01:16,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:16,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522956891] [2019-12-27 09:01:16,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:16,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522956891] [2019-12-27 09:01:16,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:16,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:01:16,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826027961] [2019-12-27 09:01:16,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:01:16,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:16,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:01:16,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:01:16,435 INFO L87 Difference]: Start difference. First operand 38407 states and 111610 transitions. Second operand 7 states. [2019-12-27 09:01:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:17,620 INFO L93 Difference]: Finished difference Result 42451 states and 122848 transitions. [2019-12-27 09:01:17,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 09:01:17,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-27 09:01:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:17,679 INFO L225 Difference]: With dead ends: 42451 [2019-12-27 09:01:17,679 INFO L226 Difference]: Without dead ends: 42374 [2019-12-27 09:01:17,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 09:01:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42374 states. [2019-12-27 09:01:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42374 to 35772. [2019-12-27 09:01:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35772 states. [2019-12-27 09:01:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35772 states to 35772 states and 105060 transitions. [2019-12-27 09:01:18,181 INFO L78 Accepts]: Start accepts. Automaton has 35772 states and 105060 transitions. Word has length 75 [2019-12-27 09:01:18,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:18,181 INFO L462 AbstractCegarLoop]: Abstraction has 35772 states and 105060 transitions. [2019-12-27 09:01:18,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:01:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 35772 states and 105060 transitions. [2019-12-27 09:01:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 09:01:18,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:18,194 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] [2019-12-27 09:01:18,194 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:18,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1806509476, now seen corresponding path program 1 times [2019-12-27 09:01:18,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:18,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131946639] [2019-12-27 09:01:18,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:18,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131946639] [2019-12-27 09:01:18,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:18,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:01:18,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612269586] [2019-12-27 09:01:18,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:01:18,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:18,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:01:18,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:01:18,281 INFO L87 Difference]: Start difference. First operand 35772 states and 105060 transitions. Second operand 7 states. [2019-12-27 09:01:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:19,562 INFO L93 Difference]: Finished difference Result 47965 states and 138281 transitions. [2019-12-27 09:01:19,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 09:01:19,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-27 09:01:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:19,631 INFO L225 Difference]: With dead ends: 47965 [2019-12-27 09:01:19,631 INFO L226 Difference]: Without dead ends: 47917 [2019-12-27 09:01:19,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-27 09:01:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47917 states. [2019-12-27 09:01:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47917 to 39863. [2019-12-27 09:01:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39863 states. [2019-12-27 09:01:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39863 states to 39863 states and 115528 transitions. [2019-12-27 09:01:20,432 INFO L78 Accepts]: Start accepts. Automaton has 39863 states and 115528 transitions. Word has length 77 [2019-12-27 09:01:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:20,432 INFO L462 AbstractCegarLoop]: Abstraction has 39863 states and 115528 transitions. [2019-12-27 09:01:20,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:01:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 39863 states and 115528 transitions. [2019-12-27 09:01:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-27 09:01:20,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:20,452 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] [2019-12-27 09:01:20,452 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash -158428104, now seen corresponding path program 1 times [2019-12-27 09:01:20,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:20,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771013885] [2019-12-27 09:01:20,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:20,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771013885] [2019-12-27 09:01:20,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:20,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:01:20,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315147708] [2019-12-27 09:01:20,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:01:20,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:20,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:01:20,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:01:20,501 INFO L87 Difference]: Start difference. First operand 39863 states and 115528 transitions. Second operand 3 states. [2019-12-27 09:01:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:20,900 INFO L93 Difference]: Finished difference Result 48922 states and 139928 transitions. [2019-12-27 09:01:20,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:01:20,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-27 09:01:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:20,972 INFO L225 Difference]: With dead ends: 48922 [2019-12-27 09:01:20,973 INFO L226 Difference]: Without dead ends: 48922 [2019-12-27 09:01:20,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:01:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48922 states. [2019-12-27 09:01:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48922 to 45026. [2019-12-27 09:01:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45026 states. [2019-12-27 09:01:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45026 states to 45026 states and 129459 transitions. [2019-12-27 09:01:22,009 INFO L78 Accepts]: Start accepts. Automaton has 45026 states and 129459 transitions. Word has length 82 [2019-12-27 09:01:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:22,009 INFO L462 AbstractCegarLoop]: Abstraction has 45026 states and 129459 transitions. [2019-12-27 09:01:22,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:01:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 45026 states and 129459 transitions. [2019-12-27 09:01:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 09:01:22,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:22,037 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] [2019-12-27 09:01:22,037 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:22,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:22,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1134405531, now seen corresponding path program 1 times [2019-12-27 09:01:22,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:22,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900806472] [2019-12-27 09:01:22,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:22,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900806472] [2019-12-27 09:01:22,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:22,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:01:22,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353066733] [2019-12-27 09:01:22,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:01:22,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:22,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:01:22,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:01:22,097 INFO L87 Difference]: Start difference. First operand 45026 states and 129459 transitions. Second operand 4 states. [2019-12-27 09:01:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:22,547 INFO L93 Difference]: Finished difference Result 49702 states and 142198 transitions. [2019-12-27 09:01:22,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:01:22,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-27 09:01:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:22,618 INFO L225 Difference]: With dead ends: 49702 [2019-12-27 09:01:22,618 INFO L226 Difference]: Without dead ends: 49702 [2019-12-27 09:01:22,618 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-27 09:01:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49702 states. [2019-12-27 09:01:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49702 to 48859. [2019-12-27 09:01:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48859 states. [2019-12-27 09:01:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48859 states to 48859 states and 139766 transitions. [2019-12-27 09:01:23,267 INFO L78 Accepts]: Start accepts. Automaton has 48859 states and 139766 transitions. Word has length 83 [2019-12-27 09:01:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:23,267 INFO L462 AbstractCegarLoop]: Abstraction has 48859 states and 139766 transitions. [2019-12-27 09:01:23,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:01:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 48859 states and 139766 transitions. [2019-12-27 09:01:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 09:01:23,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:23,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:01:23,298 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:23,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1083352422, now seen corresponding path program 1 times [2019-12-27 09:01:23,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:23,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824279665] [2019-12-27 09:01:23,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:23,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824279665] [2019-12-27 09:01:23,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:23,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:01:23,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531308775] [2019-12-27 09:01:23,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:01:23,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:01:23,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:01:23,335 INFO L87 Difference]: Start difference. First operand 48859 states and 139766 transitions. Second operand 3 states. [2019-12-27 09:01:23,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:23,746 INFO L93 Difference]: Finished difference Result 59674 states and 167360 transitions. [2019-12-27 09:01:23,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:01:23,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-27 09:01:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:24,155 INFO L225 Difference]: With dead ends: 59674 [2019-12-27 09:01:24,155 INFO L226 Difference]: Without dead ends: 59674 [2019-12-27 09:01:24,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:01:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59674 states. [2019-12-27 09:01:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59674 to 55666. [2019-12-27 09:01:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55666 states. [2019-12-27 09:01:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55666 states to 55666 states and 157037 transitions. [2019-12-27 09:01:24,847 INFO L78 Accepts]: Start accepts. Automaton has 55666 states and 157037 transitions. Word has length 83 [2019-12-27 09:01:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:24,848 INFO L462 AbstractCegarLoop]: Abstraction has 55666 states and 157037 transitions. [2019-12-27 09:01:24,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:01:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 55666 states and 157037 transitions. [2019-12-27 09:01:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 09:01:24,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:24,879 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] [2019-12-27 09:01:24,879 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:24,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash -707975427, now seen corresponding path program 1 times [2019-12-27 09:01:24,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:24,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428827042] [2019-12-27 09:01:24,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:24,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428827042] [2019-12-27 09:01:24,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:24,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:01:24,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994189659] [2019-12-27 09:01:24,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:01:24,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:24,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:01:24,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:01:24,962 INFO L87 Difference]: Start difference. First operand 55666 states and 157037 transitions. Second operand 6 states. [2019-12-27 09:01:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:25,785 INFO L93 Difference]: Finished difference Result 75375 states and 213827 transitions. [2019-12-27 09:01:25,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 09:01:25,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-27 09:01:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:25,905 INFO L225 Difference]: With dead ends: 75375 [2019-12-27 09:01:25,905 INFO L226 Difference]: Without dead ends: 75375 [2019-12-27 09:01:25,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:01:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75375 states. [2019-12-27 09:01:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75375 to 58282. [2019-12-27 09:01:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58282 states. [2019-12-27 09:01:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58282 states to 58282 states and 163127 transitions. [2019-12-27 09:01:27,090 INFO L78 Accepts]: Start accepts. Automaton has 58282 states and 163127 transitions. Word has length 84 [2019-12-27 09:01:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:27,090 INFO L462 AbstractCegarLoop]: Abstraction has 58282 states and 163127 transitions. [2019-12-27 09:01:27,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:01:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 58282 states and 163127 transitions. [2019-12-27 09:01:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 09:01:27,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:27,121 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] [2019-12-27 09:01:27,122 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash -496624514, now seen corresponding path program 1 times [2019-12-27 09:01:27,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:27,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602949981] [2019-12-27 09:01:27,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:27,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602949981] [2019-12-27 09:01:27,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:27,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:01:27,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248103536] [2019-12-27 09:01:27,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:01:27,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:27,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:01:27,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:01:27,194 INFO L87 Difference]: Start difference. First operand 58282 states and 163127 transitions. Second operand 5 states. [2019-12-27 09:01:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:27,832 INFO L93 Difference]: Finished difference Result 72853 states and 202231 transitions. [2019-12-27 09:01:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 09:01:27,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-27 09:01:27,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:27,935 INFO L225 Difference]: With dead ends: 72853 [2019-12-27 09:01:27,935 INFO L226 Difference]: Without dead ends: 72853 [2019-12-27 09:01:27,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:01:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72853 states. [2019-12-27 09:01:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72853 to 59114. [2019-12-27 09:01:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-12-27 09:01:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 164968 transitions. [2019-12-27 09:01:29,089 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 164968 transitions. Word has length 84 [2019-12-27 09:01:29,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:29,089 INFO L462 AbstractCegarLoop]: Abstraction has 59114 states and 164968 transitions. [2019-12-27 09:01:29,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:01:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 164968 transitions. [2019-12-27 09:01:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 09:01:29,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:29,121 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] [2019-12-27 09:01:29,121 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:29,122 INFO L82 PathProgramCache]: Analyzing trace with hash -751361059, now seen corresponding path program 1 times [2019-12-27 09:01:29,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:29,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854120662] [2019-12-27 09:01:29,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:29,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854120662] [2019-12-27 09:01:29,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:29,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:01:29,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994795898] [2019-12-27 09:01:29,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:01:29,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:29,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:01:29,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:01:29,191 INFO L87 Difference]: Start difference. First operand 59114 states and 164968 transitions. Second operand 5 states. [2019-12-27 09:01:30,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:30,279 INFO L93 Difference]: Finished difference Result 65995 states and 181821 transitions. [2019-12-27 09:01:30,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:01:30,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-27 09:01:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:30,370 INFO L225 Difference]: With dead ends: 65995 [2019-12-27 09:01:30,370 INFO L226 Difference]: Without dead ends: 65995 [2019-12-27 09:01:30,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:01:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65995 states. [2019-12-27 09:01:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65995 to 63926. [2019-12-27 09:01:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63926 states. [2019-12-27 09:01:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63926 states to 63926 states and 176924 transitions. [2019-12-27 09:01:31,520 INFO L78 Accepts]: Start accepts. Automaton has 63926 states and 176924 transitions. Word has length 84 [2019-12-27 09:01:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:31,520 INFO L462 AbstractCegarLoop]: Abstraction has 63926 states and 176924 transitions. [2019-12-27 09:01:31,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:01:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 63926 states and 176924 transitions. [2019-12-27 09:01:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 09:01:31,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:31,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:01:31,554 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash 493403422, now seen corresponding path program 1 times [2019-12-27 09:01:31,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:31,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827312430] [2019-12-27 09:01:31,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:31,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827312430] [2019-12-27 09:01:31,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:31,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:01:31,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392338170] [2019-12-27 09:01:31,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:01:31,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:31,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:01:31,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:01:31,684 INFO L87 Difference]: Start difference. First operand 63926 states and 176924 transitions. Second operand 8 states. [2019-12-27 09:01:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:34,297 INFO L93 Difference]: Finished difference Result 92718 states and 257042 transitions. [2019-12-27 09:01:34,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 09:01:34,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-27 09:01:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:34,432 INFO L225 Difference]: With dead ends: 92718 [2019-12-27 09:01:34,433 INFO L226 Difference]: Without dead ends: 92400 [2019-12-27 09:01:34,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 09:01:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92400 states. [2019-12-27 09:01:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92400 to 84076. [2019-12-27 09:01:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84076 states. [2019-12-27 09:01:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84076 states to 84076 states and 232976 transitions. [2019-12-27 09:01:35,978 INFO L78 Accepts]: Start accepts. Automaton has 84076 states and 232976 transitions. Word has length 84 [2019-12-27 09:01:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:35,979 INFO L462 AbstractCegarLoop]: Abstraction has 84076 states and 232976 transitions. [2019-12-27 09:01:35,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:01:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 84076 states and 232976 transitions. [2019-12-27 09:01:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 09:01:36,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:36,022 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] [2019-12-27 09:01:36,022 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1303547937, now seen corresponding path program 1 times [2019-12-27 09:01:36,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:36,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287239584] [2019-12-27 09:01:36,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:36,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287239584] [2019-12-27 09:01:36,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:36,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:01:36,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417037765] [2019-12-27 09:01:36,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:01:36,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:36,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:01:36,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:01:36,148 INFO L87 Difference]: Start difference. First operand 84076 states and 232976 transitions. Second operand 8 states. [2019-12-27 09:01:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:39,561 INFO L93 Difference]: Finished difference Result 201342 states and 566165 transitions. [2019-12-27 09:01:39,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 09:01:39,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-12-27 09:01:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:39,888 INFO L225 Difference]: With dead ends: 201342 [2019-12-27 09:01:39,888 INFO L226 Difference]: Without dead ends: 201234 [2019-12-27 09:01:39,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2019-12-27 09:01:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201234 states. [2019-12-27 09:01:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201234 to 117759. [2019-12-27 09:01:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117759 states. [2019-12-27 09:01:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117759 states to 117759 states and 331079 transitions. [2019-12-27 09:01:42,575 INFO L78 Accepts]: Start accepts. Automaton has 117759 states and 331079 transitions. Word has length 84 [2019-12-27 09:01:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:42,575 INFO L462 AbstractCegarLoop]: Abstraction has 117759 states and 331079 transitions. [2019-12-27 09:01:42,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:01:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 117759 states and 331079 transitions. [2019-12-27 09:01:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 09:01:42,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:42,658 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] [2019-12-27 09:01:42,658 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:42,659 INFO L82 PathProgramCache]: Analyzing trace with hash -416044256, now seen corresponding path program 1 times [2019-12-27 09:01:42,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:42,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769104609] [2019-12-27 09:01:42,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:42,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769104609] [2019-12-27 09:01:42,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:42,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:01:42,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907108593] [2019-12-27 09:01:42,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:01:42,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:42,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:01:42,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:01:42,774 INFO L87 Difference]: Start difference. First operand 117759 states and 331079 transitions. Second operand 7 states. [2019-12-27 09:01:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:43,384 INFO L93 Difference]: Finished difference Result 151166 states and 427927 transitions. [2019-12-27 09:01:43,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 09:01:43,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-12-27 09:01:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:43,638 INFO L225 Difference]: With dead ends: 151166 [2019-12-27 09:01:43,638 INFO L226 Difference]: Without dead ends: 151166 [2019-12-27 09:01:43,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:01:43,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151166 states. [2019-12-27 09:01:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151166 to 103922. [2019-12-27 09:01:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103922 states. [2019-12-27 09:01:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103922 states to 103922 states and 288332 transitions. [2019-12-27 09:01:45,977 INFO L78 Accepts]: Start accepts. Automaton has 103922 states and 288332 transitions. Word has length 84 [2019-12-27 09:01:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:45,977 INFO L462 AbstractCegarLoop]: Abstraction has 103922 states and 288332 transitions. [2019-12-27 09:01:45,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:01:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 103922 states and 288332 transitions. [2019-12-27 09:01:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 09:01:46,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:01:46,026 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:46,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:46,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2146947488, now seen corresponding path program 1 times [2019-12-27 09:01:46,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:46,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629414770] [2019-12-27 09:01:46,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:46,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629414770] [2019-12-27 09:01:46,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:46,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 09:01:46,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917272163] [2019-12-27 09:01:46,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 09:01:46,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 09:01:46,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:01:46,136 INFO L87 Difference]: Start difference. First operand 103922 states and 288332 transitions. Second operand 9 states. [2019-12-27 09:01:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:48,624 INFO L93 Difference]: Finished difference Result 119728 states and 331026 transitions. [2019-12-27 09:01:48,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 09:01:48,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-12-27 09:01:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:48,816 INFO L225 Difference]: With dead ends: 119728 [2019-12-27 09:01:48,817 INFO L226 Difference]: Without dead ends: 119728 [2019-12-27 09:01:48,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-27 09:01:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119728 states. [2019-12-27 09:01:50,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119728 to 106034. [2019-12-27 09:01:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106034 states. [2019-12-27 09:01:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106034 states to 106034 states and 294177 transitions. [2019-12-27 09:01:51,115 INFO L78 Accepts]: Start accepts. Automaton has 106034 states and 294177 transitions. Word has length 84 [2019-12-27 09:01:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:51,115 INFO L462 AbstractCegarLoop]: Abstraction has 106034 states and 294177 transitions. [2019-12-27 09:01:51,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 09:01:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 106034 states and 294177 transitions. [2019-12-27 09:01:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 09:01:51,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:51,158 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] [2019-12-27 09:01:51,158 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1260516127, now seen corresponding path program 1 times [2019-12-27 09:01:51,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:51,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311353651] [2019-12-27 09:01:51,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:51,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311353651] [2019-12-27 09:01:51,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:51,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:01:51,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837594191] [2019-12-27 09:01:51,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:01:51,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:51,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:01:51,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:01:51,202 INFO L87 Difference]: Start difference. First operand 106034 states and 294177 transitions. Second operand 3 states. [2019-12-27 09:01:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:51,499 INFO L93 Difference]: Finished difference Result 88913 states and 238261 transitions. [2019-12-27 09:01:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:01:51,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-27 09:01:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:51,620 INFO L225 Difference]: With dead ends: 88913 [2019-12-27 09:01:51,621 INFO L226 Difference]: Without dead ends: 88766 [2019-12-27 09:01:51,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:01:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88766 states. [2019-12-27 09:01:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88766 to 67685. [2019-12-27 09:01:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67685 states. [2019-12-27 09:01:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67685 states to 67685 states and 179345 transitions. [2019-12-27 09:01:52,552 INFO L78 Accepts]: Start accepts. Automaton has 67685 states and 179345 transitions. Word has length 84 [2019-12-27 09:01:52,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:52,553 INFO L462 AbstractCegarLoop]: Abstraction has 67685 states and 179345 transitions. [2019-12-27 09:01:52,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:01:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 67685 states and 179345 transitions. [2019-12-27 09:01:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 09:01:52,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:52,585 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] [2019-12-27 09:01:52,585 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:52,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:52,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1843781970, now seen corresponding path program 1 times [2019-12-27 09:01:52,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:52,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444977579] [2019-12-27 09:01:52,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:52,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444977579] [2019-12-27 09:01:52,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:52,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:01:52,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194071388] [2019-12-27 09:01:52,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:01:52,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:52,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:01:52,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:01:52,678 INFO L87 Difference]: Start difference. First operand 67685 states and 179345 transitions. Second operand 8 states. [2019-12-27 09:01:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:01:56,151 INFO L93 Difference]: Finished difference Result 177080 states and 472623 transitions. [2019-12-27 09:01:56,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 09:01:56,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-12-27 09:01:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:01:56,432 INFO L225 Difference]: With dead ends: 177080 [2019-12-27 09:01:56,432 INFO L226 Difference]: Without dead ends: 176324 [2019-12-27 09:01:56,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-27 09:01:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176324 states. [2019-12-27 09:01:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176324 to 103397. [2019-12-27 09:01:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103397 states. [2019-12-27 09:01:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103397 states to 103397 states and 276153 transitions. [2019-12-27 09:01:58,773 INFO L78 Accepts]: Start accepts. Automaton has 103397 states and 276153 transitions. Word has length 85 [2019-12-27 09:01:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:01:58,773 INFO L462 AbstractCegarLoop]: Abstraction has 103397 states and 276153 transitions. [2019-12-27 09:01:58,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:01:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 103397 states and 276153 transitions. [2019-12-27 09:01:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 09:01:58,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:01:58,817 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] [2019-12-27 09:01:58,817 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:01:58,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:01:58,818 INFO L82 PathProgramCache]: Analyzing trace with hash 654233967, now seen corresponding path program 1 times [2019-12-27 09:01:58,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:01:58,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025698745] [2019-12-27 09:01:58,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:01:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:01:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:01:58,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025698745] [2019-12-27 09:01:58,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:01:58,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:01:58,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676600500] [2019-12-27 09:01:58,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:01:58,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:01:58,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:01:58,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:01:58,939 INFO L87 Difference]: Start difference. First operand 103397 states and 276153 transitions. Second operand 7 states. [2019-12-27 09:02:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:00,026 INFO L93 Difference]: Finished difference Result 129583 states and 344000 transitions. [2019-12-27 09:02:00,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:02:00,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-27 09:02:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:00,232 INFO L225 Difference]: With dead ends: 129583 [2019-12-27 09:02:00,232 INFO L226 Difference]: Without dead ends: 129569 [2019-12-27 09:02:00,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:02:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129569 states. [2019-12-27 09:02:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129569 to 113414. [2019-12-27 09:02:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113414 states. [2019-12-27 09:02:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113414 states to 113414 states and 302655 transitions. [2019-12-27 09:02:02,460 INFO L78 Accepts]: Start accepts. Automaton has 113414 states and 302655 transitions. Word has length 85 [2019-12-27 09:02:02,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:02,460 INFO L462 AbstractCegarLoop]: Abstraction has 113414 states and 302655 transitions. [2019-12-27 09:02:02,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:02:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 113414 states and 302655 transitions. [2019-12-27 09:02:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 09:02:02,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:02,506 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] [2019-12-27 09:02:02,506 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1422975376, now seen corresponding path program 1 times [2019-12-27 09:02:02,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:02,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376190330] [2019-12-27 09:02:02,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:02,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-27 09:02:02,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376190330] [2019-12-27 09:02:02,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:02,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:02:02,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806490753] [2019-12-27 09:02:02,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:02:02,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:02,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:02:02,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:02:02,600 INFO L87 Difference]: Start difference. First operand 113414 states and 302655 transitions. Second operand 7 states. [2019-12-27 09:02:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:03,618 INFO L93 Difference]: Finished difference Result 131592 states and 349080 transitions. [2019-12-27 09:02:03,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 09:02:03,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-27 09:02:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:03,821 INFO L225 Difference]: With dead ends: 131592 [2019-12-27 09:02:03,821 INFO L226 Difference]: Without dead ends: 131592 [2019-12-27 09:02:03,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:02:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131592 states. [2019-12-27 09:02:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131592 to 114610. [2019-12-27 09:02:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114610 states. [2019-12-27 09:02:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114610 states to 114610 states and 305653 transitions. [2019-12-27 09:02:06,008 INFO L78 Accepts]: Start accepts. Automaton has 114610 states and 305653 transitions. Word has length 85 [2019-12-27 09:02:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:06,008 INFO L462 AbstractCegarLoop]: Abstraction has 114610 states and 305653 transitions. [2019-12-27 09:02:06,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:02:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 114610 states and 305653 transitions. [2019-12-27 09:02:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 09:02:06,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:06,052 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] [2019-12-27 09:02:06,052 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:06,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:06,053 INFO L82 PathProgramCache]: Analyzing trace with hash 585326896, now seen corresponding path program 1 times [2019-12-27 09:02:06,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:06,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381140897] [2019-12-27 09:02:06,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:06,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381140897] [2019-12-27 09:02:06,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:06,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:02:06,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746533478] [2019-12-27 09:02:06,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:02:06,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:06,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:02:06,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:02:06,122 INFO L87 Difference]: Start difference. First operand 114610 states and 305653 transitions. Second operand 4 states. [2019-12-27 09:02:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:07,906 INFO L93 Difference]: Finished difference Result 134347 states and 361219 transitions. [2019-12-27 09:02:07,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:02:07,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-27 09:02:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:08,120 INFO L225 Difference]: With dead ends: 134347 [2019-12-27 09:02:08,120 INFO L226 Difference]: Without dead ends: 134011 [2019-12-27 09:02:08,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:02:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134011 states. [2019-12-27 09:02:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134011 to 119814. [2019-12-27 09:02:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119814 states. [2019-12-27 09:02:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119814 states to 119814 states and 321024 transitions. [2019-12-27 09:02:10,782 INFO L78 Accepts]: Start accepts. Automaton has 119814 states and 321024 transitions. Word has length 85 [2019-12-27 09:02:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:10,782 INFO L462 AbstractCegarLoop]: Abstraction has 119814 states and 321024 transitions. [2019-12-27 09:02:10,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:02:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 119814 states and 321024 transitions. [2019-12-27 09:02:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 09:02:10,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:10,826 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] [2019-12-27 09:02:10,826 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:10,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1211624463, now seen corresponding path program 1 times [2019-12-27 09:02:10,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:10,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922722377] [2019-12-27 09:02:10,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:10,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922722377] [2019-12-27 09:02:10,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:10,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:02:10,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941595059] [2019-12-27 09:02:10,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:02:10,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:10,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:02:10,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:02:10,944 INFO L87 Difference]: Start difference. First operand 119814 states and 321024 transitions. Second operand 7 states. [2019-12-27 09:02:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:11,745 INFO L93 Difference]: Finished difference Result 122135 states and 320393 transitions. [2019-12-27 09:02:11,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 09:02:11,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-27 09:02:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:11,936 INFO L225 Difference]: With dead ends: 122135 [2019-12-27 09:02:11,936 INFO L226 Difference]: Without dead ends: 122135 [2019-12-27 09:02:11,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:02:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122135 states. [2019-12-27 09:02:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122135 to 86107. [2019-12-27 09:02:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86107 states. [2019-12-27 09:02:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86107 states to 86107 states and 222856 transitions. [2019-12-27 09:02:14,080 INFO L78 Accepts]: Start accepts. Automaton has 86107 states and 222856 transitions. Word has length 85 [2019-12-27 09:02:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:14,080 INFO L462 AbstractCegarLoop]: Abstraction has 86107 states and 222856 transitions. [2019-12-27 09:02:14,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:02:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 86107 states and 222856 transitions. [2019-12-27 09:02:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 09:02:14,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:14,115 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] [2019-12-27 09:02:14,115 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:14,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:14,116 INFO L82 PathProgramCache]: Analyzing trace with hash -324120782, now seen corresponding path program 1 times [2019-12-27 09:02:14,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:14,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696404399] [2019-12-27 09:02:14,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:14,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696404399] [2019-12-27 09:02:14,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:14,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:02:14,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445511898] [2019-12-27 09:02:14,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:02:14,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:14,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:02:14,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:02:14,183 INFO L87 Difference]: Start difference. First operand 86107 states and 222856 transitions. Second operand 5 states. [2019-12-27 09:02:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:14,373 INFO L93 Difference]: Finished difference Result 45289 states and 104531 transitions. [2019-12-27 09:02:14,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:02:14,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-27 09:02:14,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:14,433 INFO L225 Difference]: With dead ends: 45289 [2019-12-27 09:02:14,434 INFO L226 Difference]: Without dead ends: 42088 [2019-12-27 09:02:14,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:02:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42088 states. [2019-12-27 09:02:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42088 to 34955. [2019-12-27 09:02:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34955 states. [2019-12-27 09:02:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34955 states to 34955 states and 80123 transitions. [2019-12-27 09:02:15,152 INFO L78 Accepts]: Start accepts. Automaton has 34955 states and 80123 transitions. Word has length 85 [2019-12-27 09:02:15,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:15,152 INFO L462 AbstractCegarLoop]: Abstraction has 34955 states and 80123 transitions. [2019-12-27 09:02:15,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:02:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 34955 states and 80123 transitions. [2019-12-27 09:02:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:15,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:15,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:15,183 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:15,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1251711441, now seen corresponding path program 1 times [2019-12-27 09:02:15,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:15,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978686662] [2019-12-27 09:02:15,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:15,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978686662] [2019-12-27 09:02:15,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:15,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:02:15,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125866564] [2019-12-27 09:02:15,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:02:15,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:15,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:02:15,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:02:15,263 INFO L87 Difference]: Start difference. First operand 34955 states and 80123 transitions. Second operand 5 states. [2019-12-27 09:02:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:15,659 INFO L93 Difference]: Finished difference Result 38835 states and 88447 transitions. [2019-12-27 09:02:15,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:02:15,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-27 09:02:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:15,700 INFO L225 Difference]: With dead ends: 38835 [2019-12-27 09:02:15,700 INFO L226 Difference]: Without dead ends: 38793 [2019-12-27 09:02:15,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:02:15,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38793 states. [2019-12-27 09:02:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38793 to 36305. [2019-12-27 09:02:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36305 states. [2019-12-27 09:02:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36305 states to 36305 states and 83084 transitions. [2019-12-27 09:02:16,129 INFO L78 Accepts]: Start accepts. Automaton has 36305 states and 83084 transitions. Word has length 114 [2019-12-27 09:02:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:16,129 INFO L462 AbstractCegarLoop]: Abstraction has 36305 states and 83084 transitions. [2019-12-27 09:02:16,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:02:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 36305 states and 83084 transitions. [2019-12-27 09:02:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:16,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:16,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:16,163 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:16,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:16,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1132645485, now seen corresponding path program 1 times [2019-12-27 09:02:16,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:16,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626721056] [2019-12-27 09:02:16,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:16,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626721056] [2019-12-27 09:02:16,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:16,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:02:16,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94091378] [2019-12-27 09:02:16,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:02:16,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:02:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:02:16,278 INFO L87 Difference]: Start difference. First operand 36305 states and 83084 transitions. Second operand 7 states. [2019-12-27 09:02:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:16,894 INFO L93 Difference]: Finished difference Result 37037 states and 84862 transitions. [2019-12-27 09:02:16,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:02:16,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2019-12-27 09:02:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:16,933 INFO L225 Difference]: With dead ends: 37037 [2019-12-27 09:02:16,933 INFO L226 Difference]: Without dead ends: 37037 [2019-12-27 09:02:16,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:02:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37037 states. [2019-12-27 09:02:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37037 to 36151. [2019-12-27 09:02:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36151 states. [2019-12-27 09:02:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36151 states to 36151 states and 82766 transitions. [2019-12-27 09:02:17,335 INFO L78 Accepts]: Start accepts. Automaton has 36151 states and 82766 transitions. Word has length 114 [2019-12-27 09:02:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:17,336 INFO L462 AbstractCegarLoop]: Abstraction has 36151 states and 82766 transitions. [2019-12-27 09:02:17,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:02:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 36151 states and 82766 transitions. [2019-12-27 09:02:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:17,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:17,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:17,369 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:17,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:17,369 INFO L82 PathProgramCache]: Analyzing trace with hash 861451702, now seen corresponding path program 1 times [2019-12-27 09:02:17,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:17,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287641358] [2019-12-27 09:02:17,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:17,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287641358] [2019-12-27 09:02:17,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:17,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 09:02:17,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410014944] [2019-12-27 09:02:17,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 09:02:17,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:17,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 09:02:17,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:02:17,509 INFO L87 Difference]: Start difference. First operand 36151 states and 82766 transitions. Second operand 9 states. [2019-12-27 09:02:18,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:18,382 INFO L93 Difference]: Finished difference Result 40956 states and 92978 transitions. [2019-12-27 09:02:18,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 09:02:18,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-12-27 09:02:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:18,426 INFO L225 Difference]: With dead ends: 40956 [2019-12-27 09:02:18,426 INFO L226 Difference]: Without dead ends: 40888 [2019-12-27 09:02:18,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-27 09:02:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40888 states. [2019-12-27 09:02:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40888 to 37968. [2019-12-27 09:02:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37968 states. [2019-12-27 09:02:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37968 states to 37968 states and 86465 transitions. [2019-12-27 09:02:18,861 INFO L78 Accepts]: Start accepts. Automaton has 37968 states and 86465 transitions. Word has length 114 [2019-12-27 09:02:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:18,861 INFO L462 AbstractCegarLoop]: Abstraction has 37968 states and 86465 transitions. [2019-12-27 09:02:18,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 09:02:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 37968 states and 86465 transitions. [2019-12-27 09:02:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:18,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:18,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:18,894 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:18,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1748955383, now seen corresponding path program 1 times [2019-12-27 09:02:18,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:18,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725757087] [2019-12-27 09:02:18,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:18,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725757087] [2019-12-27 09:02:18,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:18,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:02:18,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161886524] [2019-12-27 09:02:18,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:02:18,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:18,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:02:19,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:02:19,000 INFO L87 Difference]: Start difference. First operand 37968 states and 86465 transitions. Second operand 4 states. [2019-12-27 09:02:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:19,255 INFO L93 Difference]: Finished difference Result 39330 states and 89165 transitions. [2019-12-27 09:02:19,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:02:19,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-27 09:02:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:19,296 INFO L225 Difference]: With dead ends: 39330 [2019-12-27 09:02:19,296 INFO L226 Difference]: Without dead ends: 39330 [2019-12-27 09:02:19,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:02:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39330 states. [2019-12-27 09:02:19,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39330 to 36867. [2019-12-27 09:02:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36867 states. [2019-12-27 09:02:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36867 states to 36867 states and 83911 transitions. [2019-12-27 09:02:19,879 INFO L78 Accepts]: Start accepts. Automaton has 36867 states and 83911 transitions. Word has length 114 [2019-12-27 09:02:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:19,879 INFO L462 AbstractCegarLoop]: Abstraction has 36867 states and 83911 transitions. [2019-12-27 09:02:19,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:02:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 36867 states and 83911 transitions. [2019-12-27 09:02:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:19,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:19,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:19,914 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:19,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash -959357803, now seen corresponding path program 2 times [2019-12-27 09:02:19,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:19,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523991210] [2019-12-27 09:02:19,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:19,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523991210] [2019-12-27 09:02:19,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:19,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:02:19,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891559870] [2019-12-27 09:02:19,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:02:19,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:02:19,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:02:19,982 INFO L87 Difference]: Start difference. First operand 36867 states and 83911 transitions. Second operand 5 states. [2019-12-27 09:02:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:20,421 INFO L93 Difference]: Finished difference Result 39528 states and 89525 transitions. [2019-12-27 09:02:20,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:02:20,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-27 09:02:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:20,462 INFO L225 Difference]: With dead ends: 39528 [2019-12-27 09:02:20,462 INFO L226 Difference]: Without dead ends: 39528 [2019-12-27 09:02:20,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:02:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39528 states. [2019-12-27 09:02:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39528 to 36824. [2019-12-27 09:02:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36824 states. [2019-12-27 09:02:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36824 states to 36824 states and 83736 transitions. [2019-12-27 09:02:20,873 INFO L78 Accepts]: Start accepts. Automaton has 36824 states and 83736 transitions. Word has length 114 [2019-12-27 09:02:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:20,873 INFO L462 AbstractCegarLoop]: Abstraction has 36824 states and 83736 transitions. [2019-12-27 09:02:20,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:02:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 36824 states and 83736 transitions. [2019-12-27 09:02:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:20,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:20,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:20,907 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:20,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:20,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1036717853, now seen corresponding path program 3 times [2019-12-27 09:02:20,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:20,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587998566] [2019-12-27 09:02:20,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:20,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587998566] [2019-12-27 09:02:20,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:20,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:02:20,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313899374] [2019-12-27 09:02:20,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:02:20,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:02:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:02:20,961 INFO L87 Difference]: Start difference. First operand 36824 states and 83736 transitions. Second operand 3 states. [2019-12-27 09:02:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:21,120 INFO L93 Difference]: Finished difference Result 47385 states and 106780 transitions. [2019-12-27 09:02:21,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:02:21,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-12-27 09:02:21,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:21,188 INFO L225 Difference]: With dead ends: 47385 [2019-12-27 09:02:21,188 INFO L226 Difference]: Without dead ends: 47385 [2019-12-27 09:02:21,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:02:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47385 states. [2019-12-27 09:02:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47385 to 46837. [2019-12-27 09:02:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46837 states. [2019-12-27 09:02:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46837 states to 46837 states and 105603 transitions. [2019-12-27 09:02:21,886 INFO L78 Accepts]: Start accepts. Automaton has 46837 states and 105603 transitions. Word has length 114 [2019-12-27 09:02:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:21,886 INFO L462 AbstractCegarLoop]: Abstraction has 46837 states and 105603 transitions. [2019-12-27 09:02:21,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:02:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 46837 states and 105603 transitions. [2019-12-27 09:02:21,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:21,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:21,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:21,928 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:21,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:21,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1074572516, now seen corresponding path program 1 times [2019-12-27 09:02:21,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:21,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442627739] [2019-12-27 09:02:21,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:22,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442627739] [2019-12-27 09:02:22,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:22,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:02:22,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885609074] [2019-12-27 09:02:22,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:02:22,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:22,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:02:22,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:02:22,022 INFO L87 Difference]: Start difference. First operand 46837 states and 105603 transitions. Second operand 6 states. [2019-12-27 09:02:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:22,578 INFO L93 Difference]: Finished difference Result 53240 states and 119013 transitions. [2019-12-27 09:02:22,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:02:22,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-27 09:02:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:22,635 INFO L225 Difference]: With dead ends: 53240 [2019-12-27 09:02:22,635 INFO L226 Difference]: Without dead ends: 53240 [2019-12-27 09:02:22,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:02:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53240 states. [2019-12-27 09:02:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53240 to 48199. [2019-12-27 09:02:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48199 states. [2019-12-27 09:02:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48199 states to 48199 states and 108396 transitions. [2019-12-27 09:02:23,192 INFO L78 Accepts]: Start accepts. Automaton has 48199 states and 108396 transitions. Word has length 114 [2019-12-27 09:02:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:23,193 INFO L462 AbstractCegarLoop]: Abstraction has 48199 states and 108396 transitions. [2019-12-27 09:02:23,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:02:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 48199 states and 108396 transitions. [2019-12-27 09:02:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:23,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:23,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:23,255 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:23,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1878594116, now seen corresponding path program 1 times [2019-12-27 09:02:23,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:23,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841476009] [2019-12-27 09:02:23,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:23,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841476009] [2019-12-27 09:02:23,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:23,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:02:23,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368782278] [2019-12-27 09:02:23,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:02:23,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:23,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:02:23,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:02:23,320 INFO L87 Difference]: Start difference. First operand 48199 states and 108396 transitions. Second operand 5 states. [2019-12-27 09:02:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:23,859 INFO L93 Difference]: Finished difference Result 50626 states and 113529 transitions. [2019-12-27 09:02:23,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 09:02:23,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-27 09:02:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:23,913 INFO L225 Difference]: With dead ends: 50626 [2019-12-27 09:02:23,913 INFO L226 Difference]: Without dead ends: 50626 [2019-12-27 09:02:23,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:02:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50626 states. [2019-12-27 09:02:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50626 to 46988. [2019-12-27 09:02:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46988 states. [2019-12-27 09:02:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46988 states to 46988 states and 105609 transitions. [2019-12-27 09:02:24,667 INFO L78 Accepts]: Start accepts. Automaton has 46988 states and 105609 transitions. Word has length 114 [2019-12-27 09:02:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:24,667 INFO L462 AbstractCegarLoop]: Abstraction has 46988 states and 105609 transitions. [2019-12-27 09:02:24,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:02:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 46988 states and 105609 transitions. [2019-12-27 09:02:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:24,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:24,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:24,712 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:24,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1955954166, now seen corresponding path program 2 times [2019-12-27 09:02:24,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:24,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232128100] [2019-12-27 09:02:24,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:24,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232128100] [2019-12-27 09:02:24,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:24,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:02:24,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845417061] [2019-12-27 09:02:24,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:02:24,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:24,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:02:24,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:02:24,818 INFO L87 Difference]: Start difference. First operand 46988 states and 105609 transitions. Second operand 6 states. [2019-12-27 09:02:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:25,542 INFO L93 Difference]: Finished difference Result 52827 states and 117945 transitions. [2019-12-27 09:02:25,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:02:25,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-27 09:02:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:25,599 INFO L225 Difference]: With dead ends: 52827 [2019-12-27 09:02:25,600 INFO L226 Difference]: Without dead ends: 52827 [2019-12-27 09:02:25,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:02:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52827 states. [2019-12-27 09:02:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52827 to 45268. [2019-12-27 09:02:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45268 states. [2019-12-27 09:02:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45268 states to 45268 states and 101781 transitions. [2019-12-27 09:02:26,133 INFO L78 Accepts]: Start accepts. Automaton has 45268 states and 101781 transitions. Word has length 114 [2019-12-27 09:02:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:26,133 INFO L462 AbstractCegarLoop]: Abstraction has 45268 states and 101781 transitions. [2019-12-27 09:02:26,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:02:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 45268 states and 101781 transitions. [2019-12-27 09:02:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:26,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:26,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:26,173 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:26,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1307615315, now seen corresponding path program 4 times [2019-12-27 09:02:26,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:26,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682207254] [2019-12-27 09:02:26,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:26,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682207254] [2019-12-27 09:02:26,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:26,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:02:26,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892220714] [2019-12-27 09:02:26,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:02:26,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:26,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:02:26,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:02:26,276 INFO L87 Difference]: Start difference. First operand 45268 states and 101781 transitions. Second operand 6 states. [2019-12-27 09:02:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:26,973 INFO L93 Difference]: Finished difference Result 52374 states and 117292 transitions. [2019-12-27 09:02:26,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:02:26,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-27 09:02:26,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:27,028 INFO L225 Difference]: With dead ends: 52374 [2019-12-27 09:02:27,029 INFO L226 Difference]: Without dead ends: 52374 [2019-12-27 09:02:27,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:02:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52374 states. [2019-12-27 09:02:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52374 to 44957. [2019-12-27 09:02:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44957 states. [2019-12-27 09:02:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44957 states to 44957 states and 101031 transitions. [2019-12-27 09:02:27,762 INFO L78 Accepts]: Start accepts. Automaton has 44957 states and 101031 transitions. Word has length 114 [2019-12-27 09:02:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:27,762 INFO L462 AbstractCegarLoop]: Abstraction has 44957 states and 101031 transitions. [2019-12-27 09:02:27,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:02:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 44957 states and 101031 transitions. [2019-12-27 09:02:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:27,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:27,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:27,802 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:27,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:27,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1775984004, now seen corresponding path program 2 times [2019-12-27 09:02:27,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:27,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703634434] [2019-12-27 09:02:27,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:27,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703634434] [2019-12-27 09:02:27,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:27,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:02:27,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010933607] [2019-12-27 09:02:27,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:02:27,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:27,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:02:27,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:02:27,869 INFO L87 Difference]: Start difference. First operand 44957 states and 101031 transitions. Second operand 5 states. [2019-12-27 09:02:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:28,336 INFO L93 Difference]: Finished difference Result 45904 states and 102982 transitions. [2019-12-27 09:02:28,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 09:02:28,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-12-27 09:02:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:28,384 INFO L225 Difference]: With dead ends: 45904 [2019-12-27 09:02:28,384 INFO L226 Difference]: Without dead ends: 45904 [2019-12-27 09:02:28,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:02:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45904 states. [2019-12-27 09:02:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45904 to 45105. [2019-12-27 09:02:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45105 states. [2019-12-27 09:02:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45105 states to 45105 states and 101339 transitions. [2019-12-27 09:02:28,865 INFO L78 Accepts]: Start accepts. Automaton has 45105 states and 101339 transitions. Word has length 114 [2019-12-27 09:02:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:28,866 INFO L462 AbstractCegarLoop]: Abstraction has 45105 states and 101339 transitions. [2019-12-27 09:02:28,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:02:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 45105 states and 101339 transitions. [2019-12-27 09:02:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 09:02:28,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:28,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:28,905 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:28,905 INFO L82 PathProgramCache]: Analyzing trace with hash -350838550, now seen corresponding path program 3 times [2019-12-27 09:02:28,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:28,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530874737] [2019-12-27 09:02:28,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:28,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530874737] [2019-12-27 09:02:28,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:28,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:02:28,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750374998] [2019-12-27 09:02:28,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:02:28,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:28,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:02:28,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:02:28,982 INFO L87 Difference]: Start difference. First operand 45105 states and 101339 transitions. Second operand 6 states. [2019-12-27 09:02:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:29,547 INFO L93 Difference]: Finished difference Result 47807 states and 106985 transitions. [2019-12-27 09:02:29,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:02:29,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-27 09:02:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:29,602 INFO L225 Difference]: With dead ends: 47807 [2019-12-27 09:02:29,602 INFO L226 Difference]: Without dead ends: 47789 [2019-12-27 09:02:29,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:02:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47789 states. [2019-12-27 09:02:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47789 to 45460. [2019-12-27 09:02:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45460 states. [2019-12-27 09:02:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45460 states to 45460 states and 102100 transitions. [2019-12-27 09:02:30,329 INFO L78 Accepts]: Start accepts. Automaton has 45460 states and 102100 transitions. Word has length 114 [2019-12-27 09:02:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:30,329 INFO L462 AbstractCegarLoop]: Abstraction has 45460 states and 102100 transitions. [2019-12-27 09:02:30,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:02:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 45460 states and 102100 transitions. [2019-12-27 09:02:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-27 09:02:30,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:30,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:30,371 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:30,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:30,371 INFO L82 PathProgramCache]: Analyzing trace with hash -766622350, now seen corresponding path program 1 times [2019-12-27 09:02:30,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:30,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327090449] [2019-12-27 09:02:30,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:02:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:02:30,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327090449] [2019-12-27 09:02:30,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:02:30,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 09:02:30,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759367176] [2019-12-27 09:02:30,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 09:02:30,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:02:30,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 09:02:30,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 09:02:30,502 INFO L87 Difference]: Start difference. First operand 45460 states and 102100 transitions. Second operand 11 states. [2019-12-27 09:02:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:02:31,230 INFO L93 Difference]: Finished difference Result 72572 states and 163069 transitions. [2019-12-27 09:02:31,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 09:02:31,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2019-12-27 09:02:31,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:02:31,301 INFO L225 Difference]: With dead ends: 72572 [2019-12-27 09:02:31,302 INFO L226 Difference]: Without dead ends: 65541 [2019-12-27 09:02:31,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2019-12-27 09:02:31,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65541 states. [2019-12-27 09:02:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65541 to 48168. [2019-12-27 09:02:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48168 states. [2019-12-27 09:02:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48168 states to 48168 states and 108002 transitions. [2019-12-27 09:02:31,963 INFO L78 Accepts]: Start accepts. Automaton has 48168 states and 108002 transitions. Word has length 116 [2019-12-27 09:02:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:02:31,963 INFO L462 AbstractCegarLoop]: Abstraction has 48168 states and 108002 transitions. [2019-12-27 09:02:31,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 09:02:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 48168 states and 108002 transitions. [2019-12-27 09:02:32,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-27 09:02:32,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:02:32,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:02:32,006 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:02:32,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:02:32,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1783163100, now seen corresponding path program 2 times [2019-12-27 09:02:32,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:02:32,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470809897] [2019-12-27 09:02:32,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:02:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:02:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:02:32,110 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 09:02:32,110 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 09:02:32,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:02:32 BasicIcfg [2019-12-27 09:02:32,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 09:02:32,514 INFO L168 Benchmark]: Toolchain (without parser) took 193346.25 ms. Allocated memory was 145.8 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.5 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 09:02:32,514 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 09:02:32,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.03 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 156.3 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 09:02:32,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.76 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 09:02:32,515 INFO L168 Benchmark]: Boogie Preprocessor took 68.80 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 150.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 09:02:32,515 INFO L168 Benchmark]: RCFGBuilder took 1074.12 ms. Allocated memory is still 203.9 MB. Free memory was 150.6 MB in the beginning and 94.4 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2019-12-27 09:02:32,516 INFO L168 Benchmark]: TraceAbstraction took 191367.71 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 94.4 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 09:02:32,518 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 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.03 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 156.3 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.76 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.80 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 150.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1074.12 ms. Allocated memory is still 203.9 MB. Free memory was 150.6 MB in the beginning and 94.4 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191367.71 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 94.4 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L711] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L712] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L713] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L714] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L715] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0] [L716] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0] [L717] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L718] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L719] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L720] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L721] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L722] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L723] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L817] 0 pthread_t t6; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L818] FCALL, FORK 0 pthread_create(&t6, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L819] 0 pthread_t t7; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L820] FCALL, FORK 0 pthread_create(&t7, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L734] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L735] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L736] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L737] 1 y$r_buff0_thd1 = (_Bool)1 [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 y$flush_delayed = weak$$choice2 [L743] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L749] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L752] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L783] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L783] 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) [L784] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L784] 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)) [L785] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L785] 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)) [L786] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L786] 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)) [L787] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L787] 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)) [L788] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L788] 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)) [L789] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L789] 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)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L791] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L762] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L762] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L763] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L763] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L826] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L826] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L826] 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) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 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 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L830] 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 [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 190.7s, OverallIterations: 45, TraceHistogramMax: 1, AutomataDifference: 72.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 20172 SDtfs, 22630 SDslu, 49248 SDs, 0 SdLazy, 20790 SolverSat, 1032 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 534 GetRequests, 154 SyntacticMatches, 37 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278543occurred 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: 99.6s AutomataMinimizationTime, 44 MinimizatonAttempts, 584283 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3856 NumberOfCodeBlocks, 3856 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3696 ConstructedInterpolants, 0 QuantifiedInterpolants, 745660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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...