/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/mix022_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 10:27:43,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 10:27:43,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 10:27:43,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 10:27:43,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 10:27:43,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 10:27:43,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 10:27:43,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 10:27:43,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 10:27:43,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 10:27:43,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 10:27:43,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 10:27:43,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 10:27:43,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 10:27:43,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 10:27:43,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 10:27:43,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 10:27:43,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 10:27:43,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 10:27:43,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 10:27:43,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 10:27:43,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 10:27:43,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 10:27:43,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 10:27:43,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 10:27:43,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 10:27:43,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 10:27:43,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 10:27:43,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 10:27:43,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 10:27:43,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 10:27:43,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 10:27:43,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 10:27:44,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 10:27:44,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 10:27:44,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 10:27:44,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 10:27:44,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 10:27:44,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 10:27:44,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 10:27:44,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 10:27:44,005 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 10:27:44,037 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 10:27:44,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 10:27:44,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 10:27:44,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 10:27:44,044 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 10:27:44,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 10:27:44,045 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 10:27:44,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 10:27:44,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 10:27:44,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 10:27:44,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 10:27:44,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 10:27:44,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 10:27:44,046 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 10:27:44,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 10:27:44,046 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 10:27:44,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 10:27:44,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 10:27:44,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 10:27:44,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 10:27:44,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 10:27:44,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 10:27:44,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 10:27:44,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 10:27:44,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 10:27:44,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 10:27:44,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 10:27:44,050 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 10:27:44,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 10:27:44,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 10:27:44,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 10:27:44,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 10:27:44,354 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 10:27:44,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 10:27:44,356 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 10:27:44,357 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-27 10:27:44,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3046c211c/9a93cc2f2db84f2292747abc29463d4c/FLAGe992c1b67 [2019-12-27 10:27:44,987 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 10:27:44,987 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-27 10:27:45,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3046c211c/9a93cc2f2db84f2292747abc29463d4c/FLAGe992c1b67 [2019-12-27 10:27:45,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3046c211c/9a93cc2f2db84f2292747abc29463d4c [2019-12-27 10:27:45,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 10:27:45,305 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 10:27:45,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 10:27:45,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 10:27:45,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 10:27:45,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:27:45" (1/1) ... [2019-12-27 10:27:45,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789a3507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:45, skipping insertion in model container [2019-12-27 10:27:45,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:27:45" (1/1) ... [2019-12-27 10:27:45,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 10:27:45,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 10:27:45,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 10:27:45,959 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 10:27:46,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 10:27:46,118 INFO L208 MainTranslator]: Completed translation [2019-12-27 10:27:46,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46 WrapperNode [2019-12-27 10:27:46,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 10:27:46,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 10:27:46,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 10:27:46,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 10:27:46,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46" (1/1) ... [2019-12-27 10:27:46,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46" (1/1) ... [2019-12-27 10:27:46,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 10:27:46,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 10:27:46,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 10:27:46,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 10:27:46,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46" (1/1) ... [2019-12-27 10:27:46,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46" (1/1) ... [2019-12-27 10:27:46,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46" (1/1) ... [2019-12-27 10:27:46,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46" (1/1) ... [2019-12-27 10:27:46,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46" (1/1) ... [2019-12-27 10:27:46,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46" (1/1) ... [2019-12-27 10:27:46,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46" (1/1) ... [2019-12-27 10:27:46,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 10:27:46,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 10:27:46,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 10:27:46,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 10:27:46,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46" (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 10:27:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 10:27:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 10:27:46,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 10:27:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 10:27:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 10:27:46,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 10:27:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 10:27:46,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 10:27:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 10:27:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 10:27:46,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 10:27:46,328 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 10:27:47,064 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 10:27:47,065 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 10:27:47,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:27:47 BoogieIcfgContainer [2019-12-27 10:27:47,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 10:27:47,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 10:27:47,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 10:27:47,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 10:27:47,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:27:45" (1/3) ... [2019-12-27 10:27:47,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba46a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:27:47, skipping insertion in model container [2019-12-27 10:27:47,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:27:46" (2/3) ... [2019-12-27 10:27:47,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba46a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:27:47, skipping insertion in model container [2019-12-27 10:27:47,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:27:47" (3/3) ... [2019-12-27 10:27:47,075 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc.i [2019-12-27 10:27:47,086 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 10:27:47,086 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 10:27:47,094 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 10:27:47,095 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 10:27:47,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,145 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,194 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,194 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,194 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,200 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 10:27:47,219 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 10:27:47,237 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 10:27:47,237 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 10:27:47,238 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 10:27:47,238 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 10:27:47,238 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 10:27:47,238 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 10:27:47,238 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 10:27:47,238 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 10:27:47,253 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-27 10:27:49,435 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-12-27 10:27:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-12-27 10:27:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 10:27:49,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:27:49,445 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] [2019-12-27 10:27:49,446 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:27:49,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:27:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 515763664, now seen corresponding path program 1 times [2019-12-27 10:27:49,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:27:49,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491253228] [2019-12-27 10:27:49,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:27:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:27:49,779 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 10:27:49,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491253228] [2019-12-27 10:27:49,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:27:49,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 10:27:49,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739501157] [2019-12-27 10:27:49,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 10:27:49,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:27:49,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 10:27:49,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 10:27:49,807 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-12-27 10:27:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:27:51,255 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-12-27 10:27:51,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 10:27:51,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-27 10:27:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:27:51,518 INFO L225 Difference]: With dead ends: 33591 [2019-12-27 10:27:51,519 INFO L226 Difference]: Without dead ends: 25703 [2019-12-27 10:27:51,529 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 10:27:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-12-27 10:27:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-12-27 10:27:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-12-27 10:27:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-12-27 10:27:53,152 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-12-27 10:27:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:27:53,152 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-12-27 10:27:53,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 10:27:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-12-27 10:27:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 10:27:53,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:27:53,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:27:53,169 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:27:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:27:53,170 INFO L82 PathProgramCache]: Analyzing trace with hash 471938879, now seen corresponding path program 1 times [2019-12-27 10:27:53,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:27:53,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603823279] [2019-12-27 10:27:53,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:27:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:27:53,342 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 10:27:53,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603823279] [2019-12-27 10:27:53,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:27:53,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 10:27:53,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487342250] [2019-12-27 10:27:53,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 10:27:53,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:27:53,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 10:27:53,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 10:27:53,346 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-12-27 10:27:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:27:54,226 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-12-27 10:27:54,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 10:27:54,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-27 10:27:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:27:55,636 INFO L225 Difference]: With dead ends: 41081 [2019-12-27 10:27:55,637 INFO L226 Difference]: Without dead ends: 40545 [2019-12-27 10:27:55,637 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 10:27:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-12-27 10:27:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-12-27 10:27:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-12-27 10:27:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-12-27 10:27:56,963 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-12-27 10:27:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:27:56,965 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-12-27 10:27:56,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 10:27:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-12-27 10:27:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 10:27:56,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:27:56,971 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] [2019-12-27 10:27:56,971 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:27:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:27:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1446923185, now seen corresponding path program 1 times [2019-12-27 10:27:56,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:27:56,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921182924] [2019-12-27 10:27:56,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:27:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:27:57,056 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 10:27:57,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921182924] [2019-12-27 10:27:57,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:27:57,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 10:27:57,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33836272] [2019-12-27 10:27:57,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 10:27:57,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:27:57,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 10:27:57,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 10:27:57,060 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-12-27 10:27:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:27:58,043 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-12-27 10:27:58,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 10:27:58,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 10:27:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:27:58,190 INFO L225 Difference]: With dead ends: 49778 [2019-12-27 10:27:58,190 INFO L226 Difference]: Without dead ends: 49274 [2019-12-27 10:27:58,191 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 10:27:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-12-27 10:28:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-12-27 10:28:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-12-27 10:28:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-12-27 10:28:01,019 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-12-27 10:28:01,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:01,020 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-12-27 10:28:01,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 10:28:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-12-27 10:28:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 10:28:01,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:01,030 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 10:28:01,030 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:01,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:01,030 INFO L82 PathProgramCache]: Analyzing trace with hash -104992681, now seen corresponding path program 1 times [2019-12-27 10:28:01,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:01,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851502555] [2019-12-27 10:28:01,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:01,086 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 10:28:01,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851502555] [2019-12-27 10:28:01,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:01,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 10:28:01,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957839686] [2019-12-27 10:28:01,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 10:28:01,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:01,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 10:28:01,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 10:28:01,088 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-12-27 10:28:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:01,728 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-12-27 10:28:01,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 10:28:01,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-27 10:28:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:01,902 INFO L225 Difference]: With dead ends: 61087 [2019-12-27 10:28:01,903 INFO L226 Difference]: Without dead ends: 61087 [2019-12-27 10:28:01,903 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 10:28:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-12-27 10:28:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-12-27 10:28:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-12-27 10:28:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-12-27 10:28:04,757 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-12-27 10:28:04,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:04,758 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-12-27 10:28:04,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 10:28:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-12-27 10:28:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 10:28:04,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:04,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:04,773 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:04,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:04,774 INFO L82 PathProgramCache]: Analyzing trace with hash -604414232, now seen corresponding path program 1 times [2019-12-27 10:28:04,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:04,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825004807] [2019-12-27 10:28:04,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:04,835 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 10:28:04,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825004807] [2019-12-27 10:28:04,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:04,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 10:28:04,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973216043] [2019-12-27 10:28:04,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 10:28:04,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:04,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 10:28:04,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 10:28:04,838 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 3 states. [2019-12-27 10:28:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:05,302 INFO L93 Difference]: Finished difference Result 53336 states and 193527 transitions. [2019-12-27 10:28:05,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 10:28:05,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 10:28:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:05,466 INFO L225 Difference]: With dead ends: 53336 [2019-12-27 10:28:05,466 INFO L226 Difference]: Without dead ends: 53336 [2019-12-27 10:28:05,467 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 10:28:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53336 states. [2019-12-27 10:28:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53336 to 50674. [2019-12-27 10:28:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50674 states. [2019-12-27 10:28:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50674 states to 50674 states and 183847 transitions. [2019-12-27 10:28:06,842 INFO L78 Accepts]: Start accepts. Automaton has 50674 states and 183847 transitions. Word has length 53 [2019-12-27 10:28:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:06,842 INFO L462 AbstractCegarLoop]: Abstraction has 50674 states and 183847 transitions. [2019-12-27 10:28:06,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 10:28:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 50674 states and 183847 transitions. [2019-12-27 10:28:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 10:28:06,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:06,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:06,857 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:06,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2118465688, now seen corresponding path program 1 times [2019-12-27 10:28:06,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:06,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062014515] [2019-12-27 10:28:06,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:09,112 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 10:28:09,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062014515] [2019-12-27 10:28:09,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:09,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 10:28:09,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109552988] [2019-12-27 10:28:09,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 10:28:09,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:09,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 10:28:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 10:28:09,115 INFO L87 Difference]: Start difference. First operand 50674 states and 183847 transitions. Second operand 6 states. [2019-12-27 10:28:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:09,991 INFO L93 Difference]: Finished difference Result 65266 states and 234905 transitions. [2019-12-27 10:28:09,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 10:28:09,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 10:28:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:10,136 INFO L225 Difference]: With dead ends: 65266 [2019-12-27 10:28:10,136 INFO L226 Difference]: Without dead ends: 65266 [2019-12-27 10:28:10,136 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 10:28:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65266 states. [2019-12-27 10:28:11,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65266 to 59949. [2019-12-27 10:28:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-12-27 10:28:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-12-27 10:28:11,482 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-12-27 10:28:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:11,483 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-12-27 10:28:11,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 10:28:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-12-27 10:28:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 10:28:11,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:11,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:11,497 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash 379550249, now seen corresponding path program 1 times [2019-12-27 10:28:11,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:11,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660017978] [2019-12-27 10:28:11,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:11,603 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 10:28:11,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660017978] [2019-12-27 10:28:11,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:11,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 10:28:11,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587308638] [2019-12-27 10:28:11,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 10:28:11,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:11,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 10:28:11,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 10:28:11,606 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-12-27 10:28:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:12,831 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-12-27 10:28:12,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 10:28:12,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 10:28:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:13,574 INFO L225 Difference]: With dead ends: 83685 [2019-12-27 10:28:13,574 INFO L226 Difference]: Without dead ends: 83685 [2019-12-27 10:28:13,575 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 10:28:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-12-27 10:28:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-12-27 10:28:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-12-27 10:28:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-12-27 10:28:17,843 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-12-27 10:28:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:17,843 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-12-27 10:28:17,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 10:28:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-12-27 10:28:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 10:28:17,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:17,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:17,857 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:17,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1267053930, now seen corresponding path program 1 times [2019-12-27 10:28:17,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:17,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129319900] [2019-12-27 10:28:17,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:17,990 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 10:28:17,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129319900] [2019-12-27 10:28:17,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:17,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 10:28:17,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990077248] [2019-12-27 10:28:17,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 10:28:17,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:17,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 10:28:17,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 10:28:17,992 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 5 states. [2019-12-27 10:28:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:18,091 INFO L93 Difference]: Finished difference Result 12159 states and 37829 transitions. [2019-12-27 10:28:18,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 10:28:18,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 10:28:18,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:18,108 INFO L225 Difference]: With dead ends: 12159 [2019-12-27 10:28:18,108 INFO L226 Difference]: Without dead ends: 10674 [2019-12-27 10:28:18,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 10:28:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10674 states. [2019-12-27 10:28:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10674 to 10625. [2019-12-27 10:28:18,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10625 states. [2019-12-27 10:28:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 32591 transitions. [2019-12-27 10:28:18,250 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 32591 transitions. Word has length 53 [2019-12-27 10:28:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:18,252 INFO L462 AbstractCegarLoop]: Abstraction has 10625 states and 32591 transitions. [2019-12-27 10:28:18,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 10:28:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 32591 transitions. [2019-12-27 10:28:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 10:28:18,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:18,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:18,255 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:18,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:18,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2125589086, now seen corresponding path program 1 times [2019-12-27 10:28:18,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:18,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761006554] [2019-12-27 10:28:18,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 10:28:18,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761006554] [2019-12-27 10:28:18,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:18,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 10:28:18,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671180098] [2019-12-27 10:28:18,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 10:28:18,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:18,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 10:28:18,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 10:28:18,338 INFO L87 Difference]: Start difference. First operand 10625 states and 32591 transitions. Second operand 6 states. [2019-12-27 10:28:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:18,822 INFO L93 Difference]: Finished difference Result 13182 states and 39872 transitions. [2019-12-27 10:28:18,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 10:28:18,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 10:28:18,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:18,841 INFO L225 Difference]: With dead ends: 13182 [2019-12-27 10:28:18,841 INFO L226 Difference]: Without dead ends: 13119 [2019-12-27 10:28:18,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 10:28:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13119 states. [2019-12-27 10:28:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13119 to 11048. [2019-12-27 10:28:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11048 states. [2019-12-27 10:28:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 33785 transitions. [2019-12-27 10:28:18,990 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 33785 transitions. Word has length 53 [2019-12-27 10:28:18,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:18,990 INFO L462 AbstractCegarLoop]: Abstraction has 11048 states and 33785 transitions. [2019-12-27 10:28:18,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 10:28:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 33785 transitions. [2019-12-27 10:28:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 10:28:18,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:18,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:18,994 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:18,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:18,994 INFO L82 PathProgramCache]: Analyzing trace with hash 340486782, now seen corresponding path program 1 times [2019-12-27 10:28:18,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:18,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891708196] [2019-12-27 10:28:18,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:19,047 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 10:28:19,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891708196] [2019-12-27 10:28:19,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:19,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 10:28:19,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314523916] [2019-12-27 10:28:19,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 10:28:19,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:19,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 10:28:19,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 10:28:19,049 INFO L87 Difference]: Start difference. First operand 11048 states and 33785 transitions. Second operand 4 states. [2019-12-27 10:28:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:19,189 INFO L93 Difference]: Finished difference Result 12862 states and 39391 transitions. [2019-12-27 10:28:19,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 10:28:19,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-27 10:28:19,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:19,215 INFO L225 Difference]: With dead ends: 12862 [2019-12-27 10:28:19,216 INFO L226 Difference]: Without dead ends: 12862 [2019-12-27 10:28:19,216 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 10:28:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12862 states. [2019-12-27 10:28:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12862 to 11693. [2019-12-27 10:28:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11693 states. [2019-12-27 10:28:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11693 states to 11693 states and 35762 transitions. [2019-12-27 10:28:19,383 INFO L78 Accepts]: Start accepts. Automaton has 11693 states and 35762 transitions. Word has length 61 [2019-12-27 10:28:19,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:19,383 INFO L462 AbstractCegarLoop]: Abstraction has 11693 states and 35762 transitions. [2019-12-27 10:28:19,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 10:28:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 11693 states and 35762 transitions. [2019-12-27 10:28:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 10:28:19,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:19,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:19,389 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:19,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:19,389 INFO L82 PathProgramCache]: Analyzing trace with hash 2083297117, now seen corresponding path program 1 times [2019-12-27 10:28:19,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:19,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133675382] [2019-12-27 10:28:19,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:19,465 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 10:28:19,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133675382] [2019-12-27 10:28:19,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:19,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 10:28:19,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107020738] [2019-12-27 10:28:19,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 10:28:19,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:19,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 10:28:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 10:28:19,468 INFO L87 Difference]: Start difference. First operand 11693 states and 35762 transitions. Second operand 6 states. [2019-12-27 10:28:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:20,170 INFO L93 Difference]: Finished difference Result 14219 states and 42860 transitions. [2019-12-27 10:28:20,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 10:28:20,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-27 10:28:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:20,190 INFO L225 Difference]: With dead ends: 14219 [2019-12-27 10:28:20,191 INFO L226 Difference]: Without dead ends: 14158 [2019-12-27 10:28:20,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 10:28:20,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14158 states. [2019-12-27 10:28:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14158 to 13461. [2019-12-27 10:28:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13461 states. [2019-12-27 10:28:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 40779 transitions. [2019-12-27 10:28:20,372 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 40779 transitions. Word has length 61 [2019-12-27 10:28:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:20,372 INFO L462 AbstractCegarLoop]: Abstraction has 13461 states and 40779 transitions. [2019-12-27 10:28:20,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 10:28:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 40779 transitions. [2019-12-27 10:28:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 10:28:20,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:20,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:20,379 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:20,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:20,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1401730073, now seen corresponding path program 1 times [2019-12-27 10:28:20,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:20,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439570640] [2019-12-27 10:28:20,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:20,425 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 10:28:20,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439570640] [2019-12-27 10:28:20,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:20,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 10:28:20,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662668038] [2019-12-27 10:28:20,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 10:28:20,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 10:28:20,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 10:28:20,428 INFO L87 Difference]: Start difference. First operand 13461 states and 40779 transitions. Second operand 4 states. [2019-12-27 10:28:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:20,896 INFO L93 Difference]: Finished difference Result 18895 states and 55937 transitions. [2019-12-27 10:28:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 10:28:20,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 10:28:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:20,934 INFO L225 Difference]: With dead ends: 18895 [2019-12-27 10:28:20,934 INFO L226 Difference]: Without dead ends: 18847 [2019-12-27 10:28:20,935 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 10:28:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18847 states. [2019-12-27 10:28:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18847 to 14874. [2019-12-27 10:28:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14874 states. [2019-12-27 10:28:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14874 states to 14874 states and 44559 transitions. [2019-12-27 10:28:21,164 INFO L78 Accepts]: Start accepts. Automaton has 14874 states and 44559 transitions. Word has length 65 [2019-12-27 10:28:21,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:21,165 INFO L462 AbstractCegarLoop]: Abstraction has 14874 states and 44559 transitions. [2019-12-27 10:28:21,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 10:28:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 14874 states and 44559 transitions. [2019-12-27 10:28:21,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 10:28:21,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:21,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:21,173 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:21,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:21,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1648472742, now seen corresponding path program 1 times [2019-12-27 10:28:21,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:21,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155114693] [2019-12-27 10:28:21,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:21,259 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 10:28:21,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155114693] [2019-12-27 10:28:21,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:21,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 10:28:21,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732302720] [2019-12-27 10:28:21,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 10:28:21,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:21,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 10:28:21,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 10:28:21,262 INFO L87 Difference]: Start difference. First operand 14874 states and 44559 transitions. Second operand 4 states. [2019-12-27 10:28:21,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:21,615 INFO L93 Difference]: Finished difference Result 18169 states and 53762 transitions. [2019-12-27 10:28:21,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 10:28:21,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 10:28:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:21,651 INFO L225 Difference]: With dead ends: 18169 [2019-12-27 10:28:21,651 INFO L226 Difference]: Without dead ends: 18169 [2019-12-27 10:28:21,651 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 10:28:21,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18169 states. [2019-12-27 10:28:21,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18169 to 15114. [2019-12-27 10:28:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15114 states. [2019-12-27 10:28:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15114 states to 15114 states and 45207 transitions. [2019-12-27 10:28:21,983 INFO L78 Accepts]: Start accepts. Automaton has 15114 states and 45207 transitions. Word has length 65 [2019-12-27 10:28:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:21,984 INFO L462 AbstractCegarLoop]: Abstraction has 15114 states and 45207 transitions. [2019-12-27 10:28:21,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 10:28:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 15114 states and 45207 transitions. [2019-12-27 10:28:21,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 10:28:21,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:21,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:21,994 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:21,995 INFO L82 PathProgramCache]: Analyzing trace with hash -428736601, now seen corresponding path program 1 times [2019-12-27 10:28:21,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:21,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99789734] [2019-12-27 10:28:21,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:22,036 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 10:28:22,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99789734] [2019-12-27 10:28:22,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:22,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 10:28:22,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851587161] [2019-12-27 10:28:22,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 10:28:22,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:22,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 10:28:22,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 10:28:22,038 INFO L87 Difference]: Start difference. First operand 15114 states and 45207 transitions. Second operand 3 states. [2019-12-27 10:28:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:22,284 INFO L93 Difference]: Finished difference Result 15542 states and 46331 transitions. [2019-12-27 10:28:22,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 10:28:22,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 10:28:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:22,306 INFO L225 Difference]: With dead ends: 15542 [2019-12-27 10:28:22,306 INFO L226 Difference]: Without dead ends: 15542 [2019-12-27 10:28:22,307 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 10:28:22,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15542 states. [2019-12-27 10:28:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15542 to 15328. [2019-12-27 10:28:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15328 states. [2019-12-27 10:28:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 45749 transitions. [2019-12-27 10:28:22,745 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 45749 transitions. Word has length 65 [2019-12-27 10:28:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:22,746 INFO L462 AbstractCegarLoop]: Abstraction has 15328 states and 45749 transitions. [2019-12-27 10:28:22,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 10:28:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 45749 transitions. [2019-12-27 10:28:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 10:28:22,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:22,754 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] [2019-12-27 10:28:22,754 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:22,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash -812985011, now seen corresponding path program 1 times [2019-12-27 10:28:22,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:22,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337388887] [2019-12-27 10:28:22,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:22,864 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 10:28:22,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337388887] [2019-12-27 10:28:22,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:22,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 10:28:22,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30802467] [2019-12-27 10:28:22,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 10:28:22,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:22,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 10:28:22,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 10:28:22,866 INFO L87 Difference]: Start difference. First operand 15328 states and 45749 transitions. Second operand 6 states. [2019-12-27 10:28:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:23,355 INFO L93 Difference]: Finished difference Result 16701 states and 48916 transitions. [2019-12-27 10:28:23,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 10:28:23,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 10:28:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:23,378 INFO L225 Difference]: With dead ends: 16701 [2019-12-27 10:28:23,378 INFO L226 Difference]: Without dead ends: 16701 [2019-12-27 10:28:23,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 10:28:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16701 states. [2019-12-27 10:28:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16701 to 15510. [2019-12-27 10:28:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15510 states. [2019-12-27 10:28:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15510 states to 15510 states and 45935 transitions. [2019-12-27 10:28:23,581 INFO L78 Accepts]: Start accepts. Automaton has 15510 states and 45935 transitions. Word has length 67 [2019-12-27 10:28:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:23,582 INFO L462 AbstractCegarLoop]: Abstraction has 15510 states and 45935 transitions. [2019-12-27 10:28:23,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 10:28:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 15510 states and 45935 transitions. [2019-12-27 10:28:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 10:28:23,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:23,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:23,590 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:23,590 INFO L82 PathProgramCache]: Analyzing trace with hash -601634098, now seen corresponding path program 1 times [2019-12-27 10:28:23,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:23,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042404541] [2019-12-27 10:28:23,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:23,680 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 10:28:23,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042404541] [2019-12-27 10:28:23,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:23,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 10:28:23,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516024453] [2019-12-27 10:28:23,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 10:28:23,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:23,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 10:28:23,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 10:28:23,682 INFO L87 Difference]: Start difference. First operand 15510 states and 45935 transitions. Second operand 5 states. [2019-12-27 10:28:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:24,094 INFO L93 Difference]: Finished difference Result 19681 states and 57982 transitions. [2019-12-27 10:28:24,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 10:28:24,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 10:28:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:24,122 INFO L225 Difference]: With dead ends: 19681 [2019-12-27 10:28:24,122 INFO L226 Difference]: Without dead ends: 19681 [2019-12-27 10:28:24,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 10:28:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19681 states. [2019-12-27 10:28:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19681 to 18165. [2019-12-27 10:28:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18165 states. [2019-12-27 10:28:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18165 states to 18165 states and 53469 transitions. [2019-12-27 10:28:24,363 INFO L78 Accepts]: Start accepts. Automaton has 18165 states and 53469 transitions. Word has length 67 [2019-12-27 10:28:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:24,363 INFO L462 AbstractCegarLoop]: Abstraction has 18165 states and 53469 transitions. [2019-12-27 10:28:24,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 10:28:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 18165 states and 53469 transitions. [2019-12-27 10:28:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 10:28:24,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:24,374 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] [2019-12-27 10:28:24,374 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:24,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:24,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1112168275, now seen corresponding path program 1 times [2019-12-27 10:28:24,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:24,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444399823] [2019-12-27 10:28:24,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:24,439 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 10:28:24,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444399823] [2019-12-27 10:28:24,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:24,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 10:28:24,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865068603] [2019-12-27 10:28:24,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 10:28:24,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:24,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 10:28:24,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 10:28:24,442 INFO L87 Difference]: Start difference. First operand 18165 states and 53469 transitions. Second operand 5 states. [2019-12-27 10:28:24,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:24,991 INFO L93 Difference]: Finished difference Result 26550 states and 77182 transitions. [2019-12-27 10:28:24,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 10:28:24,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 10:28:24,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:25,028 INFO L225 Difference]: With dead ends: 26550 [2019-12-27 10:28:25,028 INFO L226 Difference]: Without dead ends: 26550 [2019-12-27 10:28:25,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 10:28:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26550 states. [2019-12-27 10:28:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26550 to 21618. [2019-12-27 10:28:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21618 states. [2019-12-27 10:28:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 62902 transitions. [2019-12-27 10:28:25,625 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 62902 transitions. Word has length 67 [2019-12-27 10:28:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:25,626 INFO L462 AbstractCegarLoop]: Abstraction has 21618 states and 62902 transitions. [2019-12-27 10:28:25,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 10:28:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 62902 transitions. [2019-12-27 10:28:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 10:28:25,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:25,635 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] [2019-12-27 10:28:25,635 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:25,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1375344558, now seen corresponding path program 1 times [2019-12-27 10:28:25,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:25,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235614431] [2019-12-27 10:28:25,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:25,688 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 10:28:25,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235614431] [2019-12-27 10:28:25,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:25,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 10:28:25,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452260803] [2019-12-27 10:28:25,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 10:28:25,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:25,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 10:28:25,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 10:28:25,690 INFO L87 Difference]: Start difference. First operand 21618 states and 62902 transitions. Second operand 4 states. [2019-12-27 10:28:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:26,318 INFO L93 Difference]: Finished difference Result 28143 states and 82198 transitions. [2019-12-27 10:28:26,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 10:28:26,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 10:28:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:26,359 INFO L225 Difference]: With dead ends: 28143 [2019-12-27 10:28:26,359 INFO L226 Difference]: Without dead ends: 28008 [2019-12-27 10:28:26,360 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 10:28:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28008 states. [2019-12-27 10:28:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28008 to 26043. [2019-12-27 10:28:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26043 states. [2019-12-27 10:28:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26043 states to 26043 states and 76088 transitions. [2019-12-27 10:28:26,715 INFO L78 Accepts]: Start accepts. Automaton has 26043 states and 76088 transitions. Word has length 67 [2019-12-27 10:28:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:26,715 INFO L462 AbstractCegarLoop]: Abstraction has 26043 states and 76088 transitions. [2019-12-27 10:28:26,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 10:28:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 26043 states and 76088 transitions. [2019-12-27 10:28:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 10:28:26,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:26,724 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] [2019-12-27 10:28:26,724 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash -421606801, now seen corresponding path program 1 times [2019-12-27 10:28:26,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:26,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433574255] [2019-12-27 10:28:26,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 10:28:26,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433574255] [2019-12-27 10:28:26,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:26,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 10:28:26,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853705921] [2019-12-27 10:28:26,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 10:28:26,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:26,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 10:28:26,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 10:28:26,800 INFO L87 Difference]: Start difference. First operand 26043 states and 76088 transitions. Second operand 5 states. [2019-12-27 10:28:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:26,857 INFO L93 Difference]: Finished difference Result 6987 states and 16662 transitions. [2019-12-27 10:28:26,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 10:28:26,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 10:28:26,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:26,866 INFO L225 Difference]: With dead ends: 6987 [2019-12-27 10:28:26,866 INFO L226 Difference]: Without dead ends: 5679 [2019-12-27 10:28:26,866 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 10:28:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5679 states. [2019-12-27 10:28:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5679 to 4422. [2019-12-27 10:28:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2019-12-27 10:28:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 10396 transitions. [2019-12-27 10:28:26,939 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 10396 transitions. Word has length 67 [2019-12-27 10:28:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:26,940 INFO L462 AbstractCegarLoop]: Abstraction has 4422 states and 10396 transitions. [2019-12-27 10:28:26,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 10:28:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 10396 transitions. [2019-12-27 10:28:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 10:28:26,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:26,946 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] [2019-12-27 10:28:26,946 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:26,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:26,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2130159502, now seen corresponding path program 1 times [2019-12-27 10:28:26,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:26,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540579284] [2019-12-27 10:28:26,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:26,981 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 10:28:26,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540579284] [2019-12-27 10:28:26,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:26,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 10:28:26,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362797791] [2019-12-27 10:28:26,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 10:28:26,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:26,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 10:28:26,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 10:28:26,983 INFO L87 Difference]: Start difference. First operand 4422 states and 10396 transitions. Second operand 3 states. [2019-12-27 10:28:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:27,021 INFO L93 Difference]: Finished difference Result 5917 states and 13768 transitions. [2019-12-27 10:28:27,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 10:28:27,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 10:28:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:27,030 INFO L225 Difference]: With dead ends: 5917 [2019-12-27 10:28:27,030 INFO L226 Difference]: Without dead ends: 5917 [2019-12-27 10:28:27,030 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 10:28:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5917 states. [2019-12-27 10:28:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5917 to 4365. [2019-12-27 10:28:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2019-12-27 10:28:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 10043 transitions. [2019-12-27 10:28:27,113 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 10043 transitions. Word has length 67 [2019-12-27 10:28:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:27,114 INFO L462 AbstractCegarLoop]: Abstraction has 4365 states and 10043 transitions. [2019-12-27 10:28:27,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 10:28:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 10043 transitions. [2019-12-27 10:28:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 10:28:27,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:27,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:27,122 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash -347462239, now seen corresponding path program 1 times [2019-12-27 10:28:27,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:27,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349170965] [2019-12-27 10:28:27,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:27,201 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 10:28:27,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349170965] [2019-12-27 10:28:27,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:27,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 10:28:27,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276352721] [2019-12-27 10:28:27,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 10:28:27,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:27,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 10:28:27,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 10:28:27,204 INFO L87 Difference]: Start difference. First operand 4365 states and 10043 transitions. Second operand 5 states. [2019-12-27 10:28:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:27,462 INFO L93 Difference]: Finished difference Result 5332 states and 12274 transitions. [2019-12-27 10:28:27,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 10:28:27,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-27 10:28:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:27,472 INFO L225 Difference]: With dead ends: 5332 [2019-12-27 10:28:27,473 INFO L226 Difference]: Without dead ends: 5332 [2019-12-27 10:28:27,473 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 10:28:27,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5332 states. [2019-12-27 10:28:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5332 to 4751. [2019-12-27 10:28:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4751 states. [2019-12-27 10:28:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4751 states to 4751 states and 10932 transitions. [2019-12-27 10:28:27,569 INFO L78 Accepts]: Start accepts. Automaton has 4751 states and 10932 transitions. Word has length 73 [2019-12-27 10:28:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:27,570 INFO L462 AbstractCegarLoop]: Abstraction has 4751 states and 10932 transitions. [2019-12-27 10:28:27,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 10:28:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4751 states and 10932 transitions. [2019-12-27 10:28:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-27 10:28:27,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:27,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:27,579 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:27,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1395348096, now seen corresponding path program 1 times [2019-12-27 10:28:27,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:27,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509271614] [2019-12-27 10:28:27,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:27,673 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 10:28:27,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509271614] [2019-12-27 10:28:27,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:27,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 10:28:27,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357314538] [2019-12-27 10:28:27,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 10:28:27,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:27,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 10:28:27,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 10:28:27,676 INFO L87 Difference]: Start difference. First operand 4751 states and 10932 transitions. Second operand 7 states. [2019-12-27 10:28:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:28,075 INFO L93 Difference]: Finished difference Result 5680 states and 12932 transitions. [2019-12-27 10:28:28,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 10:28:28,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-27 10:28:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:28,083 INFO L225 Difference]: With dead ends: 5680 [2019-12-27 10:28:28,083 INFO L226 Difference]: Without dead ends: 5627 [2019-12-27 10:28:28,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 10:28:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5627 states. [2019-12-27 10:28:28,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5627 to 4809. [2019-12-27 10:28:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4809 states. [2019-12-27 10:28:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 10981 transitions. [2019-12-27 10:28:28,159 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 10981 transitions. Word has length 73 [2019-12-27 10:28:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:28,159 INFO L462 AbstractCegarLoop]: Abstraction has 4809 states and 10981 transitions. [2019-12-27 10:28:28,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 10:28:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 10981 transitions. [2019-12-27 10:28:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 10:28:28,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:28,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:28,166 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:28,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:28,166 INFO L82 PathProgramCache]: Analyzing trace with hash -901640672, now seen corresponding path program 1 times [2019-12-27 10:28:28,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:28,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788736041] [2019-12-27 10:28:28,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:28,219 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 10:28:28,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788736041] [2019-12-27 10:28:28,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:28,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 10:28:28,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446920723] [2019-12-27 10:28:28,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 10:28:28,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:28,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 10:28:28,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 10:28:28,224 INFO L87 Difference]: Start difference. First operand 4809 states and 10981 transitions. Second operand 3 states. [2019-12-27 10:28:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:28,399 INFO L93 Difference]: Finished difference Result 6433 states and 14300 transitions. [2019-12-27 10:28:28,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 10:28:28,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-12-27 10:28:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:28,407 INFO L225 Difference]: With dead ends: 6433 [2019-12-27 10:28:28,407 INFO L226 Difference]: Without dead ends: 6142 [2019-12-27 10:28:28,407 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 10:28:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6142 states. [2019-12-27 10:28:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6142 to 5643. [2019-12-27 10:28:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5643 states. [2019-12-27 10:28:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5643 states to 5643 states and 12707 transitions. [2019-12-27 10:28:28,465 INFO L78 Accepts]: Start accepts. Automaton has 5643 states and 12707 transitions. Word has length 92 [2019-12-27 10:28:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:28,465 INFO L462 AbstractCegarLoop]: Abstraction has 5643 states and 12707 transitions. [2019-12-27 10:28:28,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 10:28:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5643 states and 12707 transitions. [2019-12-27 10:28:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 10:28:28,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:28,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 10:28:28,471 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:28,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1251680806, now seen corresponding path program 1 times [2019-12-27 10:28:28,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:28,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961272762] [2019-12-27 10:28:28,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:28,537 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 10:28:28,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961272762] [2019-12-27 10:28:28,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:28,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 10:28:28,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901245434] [2019-12-27 10:28:28,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 10:28:28,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:28,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 10:28:28,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 10:28:28,539 INFO L87 Difference]: Start difference. First operand 5643 states and 12707 transitions. Second operand 4 states. [2019-12-27 10:28:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:28,804 INFO L93 Difference]: Finished difference Result 6001 states and 13550 transitions. [2019-12-27 10:28:28,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 10:28:28,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-27 10:28:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:28,810 INFO L225 Difference]: With dead ends: 6001 [2019-12-27 10:28:28,810 INFO L226 Difference]: Without dead ends: 6001 [2019-12-27 10:28:28,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 10:28:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2019-12-27 10:28:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 5588. [2019-12-27 10:28:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5588 states. [2019-12-27 10:28:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5588 states to 5588 states and 12666 transitions. [2019-12-27 10:28:28,866 INFO L78 Accepts]: Start accepts. Automaton has 5588 states and 12666 transitions. Word has length 92 [2019-12-27 10:28:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:28,866 INFO L462 AbstractCegarLoop]: Abstraction has 5588 states and 12666 transitions. [2019-12-27 10:28:28,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 10:28:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5588 states and 12666 transitions. [2019-12-27 10:28:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 10:28:28,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:28,873 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] [2019-12-27 10:28:28,873 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:28,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:28,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1750155578, now seen corresponding path program 1 times [2019-12-27 10:28:28,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:28,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146435961] [2019-12-27 10:28:28,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 10:28:28,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146435961] [2019-12-27 10:28:28,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:28,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 10:28:28,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086942600] [2019-12-27 10:28:28,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 10:28:28,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:28,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 10:28:28,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 10:28:28,954 INFO L87 Difference]: Start difference. First operand 5588 states and 12666 transitions. Second operand 5 states. [2019-12-27 10:28:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:29,103 INFO L93 Difference]: Finished difference Result 6497 states and 14647 transitions. [2019-12-27 10:28:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 10:28:29,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 10:28:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:29,113 INFO L225 Difference]: With dead ends: 6497 [2019-12-27 10:28:29,113 INFO L226 Difference]: Without dead ends: 6497 [2019-12-27 10:28:29,114 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 10:28:29,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6497 states. [2019-12-27 10:28:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6497 to 5002. [2019-12-27 10:28:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5002 states. [2019-12-27 10:28:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5002 states to 5002 states and 11317 transitions. [2019-12-27 10:28:29,198 INFO L78 Accepts]: Start accepts. Automaton has 5002 states and 11317 transitions. Word has length 94 [2019-12-27 10:28:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:29,199 INFO L462 AbstractCegarLoop]: Abstraction has 5002 states and 11317 transitions. [2019-12-27 10:28:29,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 10:28:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5002 states and 11317 transitions. [2019-12-27 10:28:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 10:28:29,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:29,206 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] [2019-12-27 10:28:29,206 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:29,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:29,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2004892123, now seen corresponding path program 1 times [2019-12-27 10:28:29,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:29,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354904723] [2019-12-27 10:28:29,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:29,272 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 10:28:29,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354904723] [2019-12-27 10:28:29,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:29,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 10:28:29,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744307844] [2019-12-27 10:28:29,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 10:28:29,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:29,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 10:28:29,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 10:28:29,274 INFO L87 Difference]: Start difference. First operand 5002 states and 11317 transitions. Second operand 5 states. [2019-12-27 10:28:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:29,778 INFO L93 Difference]: Finished difference Result 8089 states and 18313 transitions. [2019-12-27 10:28:29,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 10:28:29,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 10:28:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:29,790 INFO L225 Difference]: With dead ends: 8089 [2019-12-27 10:28:29,790 INFO L226 Difference]: Without dead ends: 8075 [2019-12-27 10:28:29,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 10:28:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2019-12-27 10:28:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 5781. [2019-12-27 10:28:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5781 states. [2019-12-27 10:28:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5781 states to 5781 states and 13148 transitions. [2019-12-27 10:28:29,885 INFO L78 Accepts]: Start accepts. Automaton has 5781 states and 13148 transitions. Word has length 94 [2019-12-27 10:28:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:29,885 INFO L462 AbstractCegarLoop]: Abstraction has 5781 states and 13148 transitions. [2019-12-27 10:28:29,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 10:28:29,885 INFO L276 IsEmpty]: Start isEmpty. Operand 5781 states and 13148 transitions. [2019-12-27 10:28:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 10:28:29,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:29,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] [2019-12-27 10:28:29,894 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:29,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash -760127642, now seen corresponding path program 1 times [2019-12-27 10:28:29,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:29,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440461547] [2019-12-27 10:28:29,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:29,976 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 10:28:29,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440461547] [2019-12-27 10:28:29,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:29,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 10:28:29,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965809962] [2019-12-27 10:28:29,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 10:28:29,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:29,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 10:28:29,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 10:28:29,978 INFO L87 Difference]: Start difference. First operand 5781 states and 13148 transitions. Second operand 6 states. [2019-12-27 10:28:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:30,344 INFO L93 Difference]: Finished difference Result 7670 states and 17182 transitions. [2019-12-27 10:28:30,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 10:28:30,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 10:28:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:30,353 INFO L225 Difference]: With dead ends: 7670 [2019-12-27 10:28:30,353 INFO L226 Difference]: Without dead ends: 7670 [2019-12-27 10:28:30,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 10:28:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2019-12-27 10:28:30,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 5893. [2019-12-27 10:28:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5893 states. [2019-12-27 10:28:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 13284 transitions. [2019-12-27 10:28:30,420 INFO L78 Accepts]: Start accepts. Automaton has 5893 states and 13284 transitions. Word has length 94 [2019-12-27 10:28:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:30,420 INFO L462 AbstractCegarLoop]: Abstraction has 5893 states and 13284 transitions. [2019-12-27 10:28:30,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 10:28:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 5893 states and 13284 transitions. [2019-12-27 10:28:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 10:28:30,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:30,426 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] [2019-12-27 10:28:30,426 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2122986255, now seen corresponding path program 1 times [2019-12-27 10:28:30,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:30,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763640224] [2019-12-27 10:28:30,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:30,581 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 10:28:30,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763640224] [2019-12-27 10:28:30,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:30,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 10:28:30,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024928252] [2019-12-27 10:28:30,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 10:28:30,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:30,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 10:28:30,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 10:28:30,583 INFO L87 Difference]: Start difference. First operand 5893 states and 13284 transitions. Second operand 7 states. [2019-12-27 10:28:31,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:31,040 INFO L93 Difference]: Finished difference Result 7762 states and 17252 transitions. [2019-12-27 10:28:31,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 10:28:31,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 10:28:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:31,050 INFO L225 Difference]: With dead ends: 7762 [2019-12-27 10:28:31,050 INFO L226 Difference]: Without dead ends: 7664 [2019-12-27 10:28:31,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 10:28:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7664 states. [2019-12-27 10:28:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7664 to 6343. [2019-12-27 10:28:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6343 states. [2019-12-27 10:28:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6343 states to 6343 states and 14227 transitions. [2019-12-27 10:28:31,117 INFO L78 Accepts]: Start accepts. Automaton has 6343 states and 14227 transitions. Word has length 94 [2019-12-27 10:28:31,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:31,117 INFO L462 AbstractCegarLoop]: Abstraction has 6343 states and 14227 transitions. [2019-12-27 10:28:31,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 10:28:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 6343 states and 14227 transitions. [2019-12-27 10:28:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 10:28:31,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:31,123 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] [2019-12-27 10:28:31,123 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:31,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1048393392, now seen corresponding path program 1 times [2019-12-27 10:28:31,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:31,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046935502] [2019-12-27 10:28:31,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:31,255 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 10:28:31,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046935502] [2019-12-27 10:28:31,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:31,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 10:28:31,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552103309] [2019-12-27 10:28:31,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 10:28:31,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:31,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 10:28:31,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 10:28:31,257 INFO L87 Difference]: Start difference. First operand 6343 states and 14227 transitions. Second operand 9 states. [2019-12-27 10:28:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:31,928 INFO L93 Difference]: Finished difference Result 8984 states and 20052 transitions. [2019-12-27 10:28:31,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 10:28:31,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-27 10:28:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:31,939 INFO L225 Difference]: With dead ends: 8984 [2019-12-27 10:28:31,940 INFO L226 Difference]: Without dead ends: 8966 [2019-12-27 10:28:31,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-27 10:28:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2019-12-27 10:28:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 7988. [2019-12-27 10:28:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7988 states. [2019-12-27 10:28:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7988 states to 7988 states and 17848 transitions. [2019-12-27 10:28:32,025 INFO L78 Accepts]: Start accepts. Automaton has 7988 states and 17848 transitions. Word has length 94 [2019-12-27 10:28:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:32,025 INFO L462 AbstractCegarLoop]: Abstraction has 7988 states and 17848 transitions. [2019-12-27 10:28:32,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 10:28:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 7988 states and 17848 transitions. [2019-12-27 10:28:32,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 10:28:32,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:32,032 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] [2019-12-27 10:28:32,032 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:32,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:32,033 INFO L82 PathProgramCache]: Analyzing trace with hash -748557967, now seen corresponding path program 1 times [2019-12-27 10:28:32,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:32,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446444643] [2019-12-27 10:28:32,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 10:28:32,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446444643] [2019-12-27 10:28:32,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:32,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 10:28:32,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481425741] [2019-12-27 10:28:32,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 10:28:32,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:32,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 10:28:32,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 10:28:32,155 INFO L87 Difference]: Start difference. First operand 7988 states and 17848 transitions. Second operand 8 states. [2019-12-27 10:28:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:32,748 INFO L93 Difference]: Finished difference Result 11261 states and 25318 transitions. [2019-12-27 10:28:32,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 10:28:32,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-27 10:28:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:32,773 INFO L225 Difference]: With dead ends: 11261 [2019-12-27 10:28:32,773 INFO L226 Difference]: Without dead ends: 11261 [2019-12-27 10:28:32,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 10:28:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11261 states. [2019-12-27 10:28:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11261 to 8323. [2019-12-27 10:28:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8323 states. [2019-12-27 10:28:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8323 states to 8323 states and 18699 transitions. [2019-12-27 10:28:32,919 INFO L78 Accepts]: Start accepts. Automaton has 8323 states and 18699 transitions. Word has length 94 [2019-12-27 10:28:32,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:32,919 INFO L462 AbstractCegarLoop]: Abstraction has 8323 states and 18699 transitions. [2019-12-27 10:28:32,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 10:28:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8323 states and 18699 transitions. [2019-12-27 10:28:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 10:28:32,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:32,930 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] [2019-12-27 10:28:32,930 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:32,930 INFO L82 PathProgramCache]: Analyzing trace with hash 138945714, now seen corresponding path program 1 times [2019-12-27 10:28:32,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:32,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186466228] [2019-12-27 10:28:32,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:33,239 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 10:28:33,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186466228] [2019-12-27 10:28:33,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:33,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 10:28:33,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583737627] [2019-12-27 10:28:33,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 10:28:33,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:33,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 10:28:33,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 10:28:33,241 INFO L87 Difference]: Start difference. First operand 8323 states and 18699 transitions. Second operand 7 states. [2019-12-27 10:28:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:33,398 INFO L93 Difference]: Finished difference Result 10478 states and 23417 transitions. [2019-12-27 10:28:33,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 10:28:33,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-27 10:28:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:33,408 INFO L225 Difference]: With dead ends: 10478 [2019-12-27 10:28:33,408 INFO L226 Difference]: Without dead ends: 10478 [2019-12-27 10:28:33,409 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 10:28:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10478 states. [2019-12-27 10:28:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10478 to 7735. [2019-12-27 10:28:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7735 states. [2019-12-27 10:28:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7735 states to 7735 states and 17260 transitions. [2019-12-27 10:28:33,497 INFO L78 Accepts]: Start accepts. Automaton has 7735 states and 17260 transitions. Word has length 94 [2019-12-27 10:28:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:33,497 INFO L462 AbstractCegarLoop]: Abstraction has 7735 states and 17260 transitions. [2019-12-27 10:28:33,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 10:28:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 7735 states and 17260 transitions. [2019-12-27 10:28:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 10:28:33,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:33,504 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] [2019-12-27 10:28:33,504 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1593029838, now seen corresponding path program 1 times [2019-12-27 10:28:33,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:33,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126175403] [2019-12-27 10:28:33,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:33,609 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 10:28:33,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126175403] [2019-12-27 10:28:33,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:33,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 10:28:33,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408985010] [2019-12-27 10:28:33,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 10:28:33,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:33,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 10:28:33,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 10:28:33,611 INFO L87 Difference]: Start difference. First operand 7735 states and 17260 transitions. Second operand 6 states. [2019-12-27 10:28:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:33,762 INFO L93 Difference]: Finished difference Result 7465 states and 16486 transitions. [2019-12-27 10:28:33,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 10:28:33,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 10:28:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:33,774 INFO L225 Difference]: With dead ends: 7465 [2019-12-27 10:28:33,774 INFO L226 Difference]: Without dead ends: 7465 [2019-12-27 10:28:33,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 10:28:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2019-12-27 10:28:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 4718. [2019-12-27 10:28:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4718 states. [2019-12-27 10:28:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 10474 transitions. [2019-12-27 10:28:33,862 INFO L78 Accepts]: Start accepts. Automaton has 4718 states and 10474 transitions. Word has length 94 [2019-12-27 10:28:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:33,863 INFO L462 AbstractCegarLoop]: Abstraction has 4718 states and 10474 transitions. [2019-12-27 10:28:33,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 10:28:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 10474 transitions. [2019-12-27 10:28:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 10:28:33,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:33,869 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] [2019-12-27 10:28:33,869 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:33,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash 733241581, now seen corresponding path program 1 times [2019-12-27 10:28:33,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:33,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906499259] [2019-12-27 10:28:33,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 10:28:33,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906499259] [2019-12-27 10:28:33,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:33,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 10:28:33,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798188381] [2019-12-27 10:28:33,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 10:28:33,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:33,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 10:28:33,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 10:28:33,971 INFO L87 Difference]: Start difference. First operand 4718 states and 10474 transitions. Second operand 5 states. [2019-12-27 10:28:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:34,013 INFO L93 Difference]: Finished difference Result 4718 states and 10465 transitions. [2019-12-27 10:28:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 10:28:34,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-27 10:28:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:34,020 INFO L225 Difference]: With dead ends: 4718 [2019-12-27 10:28:34,020 INFO L226 Difference]: Without dead ends: 4718 [2019-12-27 10:28:34,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 10:28:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2019-12-27 10:28:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4718. [2019-12-27 10:28:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4718 states. [2019-12-27 10:28:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 10465 transitions. [2019-12-27 10:28:34,083 INFO L78 Accepts]: Start accepts. Automaton has 4718 states and 10465 transitions. Word has length 96 [2019-12-27 10:28:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:34,084 INFO L462 AbstractCegarLoop]: Abstraction has 4718 states and 10465 transitions. [2019-12-27 10:28:34,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 10:28:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 10465 transitions. [2019-12-27 10:28:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 10:28:34,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:34,088 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] [2019-12-27 10:28:34,088 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:34,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:34,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1620745262, now seen corresponding path program 1 times [2019-12-27 10:28:34,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:34,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478105470] [2019-12-27 10:28:34,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 10:28:34,207 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 10:28:34,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478105470] [2019-12-27 10:28:34,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 10:28:34,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 10:28:34,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937340413] [2019-12-27 10:28:34,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 10:28:34,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 10:28:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 10:28:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-27 10:28:34,209 INFO L87 Difference]: Start difference. First operand 4718 states and 10465 transitions. Second operand 10 states. [2019-12-27 10:28:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 10:28:34,748 INFO L93 Difference]: Finished difference Result 14876 states and 33451 transitions. [2019-12-27 10:28:34,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 10:28:34,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 10:28:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 10:28:34,767 INFO L225 Difference]: With dead ends: 14876 [2019-12-27 10:28:34,768 INFO L226 Difference]: Without dead ends: 10070 [2019-12-27 10:28:34,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 10:28:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10070 states. [2019-12-27 10:28:34,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10070 to 4739. [2019-12-27 10:28:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4739 states. [2019-12-27 10:28:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 10414 transitions. [2019-12-27 10:28:34,905 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 10414 transitions. Word has length 96 [2019-12-27 10:28:34,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 10:28:34,905 INFO L462 AbstractCegarLoop]: Abstraction has 4739 states and 10414 transitions. [2019-12-27 10:28:34,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 10:28:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 10414 transitions. [2019-12-27 10:28:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 10:28:34,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 10:28:34,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] [2019-12-27 10:28:34,914 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 10:28:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 10:28:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash -393959572, now seen corresponding path program 2 times [2019-12-27 10:28:34,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 10:28:34,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172216757] [2019-12-27 10:28:34,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 10:28:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 10:28:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 10:28:35,060 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 10:28:35,061 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 10:28:35,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:28:35 BasicIcfg [2019-12-27 10:28:35,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 10:28:35,369 INFO L168 Benchmark]: Toolchain (without parser) took 50062.95 ms. Allocated memory was 146.3 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 101.5 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 10:28:35,369 INFO L168 Benchmark]: CDTParser took 1.59 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 10:28:35,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 813.75 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 158.4 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 10:28:35,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.53 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 10:28:35,371 INFO L168 Benchmark]: Boogie Preprocessor took 48.53 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 10:28:35,371 INFO L168 Benchmark]: RCFGBuilder took 829.68 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 109.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 10:28:35,371 INFO L168 Benchmark]: TraceAbstraction took 48297.76 ms. Allocated memory was 203.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 108.5 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 10:28:35,373 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.59 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 813.75 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 158.4 MB in the end (delta: -57.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.53 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.53 ms. Allocated memory is still 203.9 MB. Free memory was 155.8 MB in the beginning and 153.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 829.68 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 109.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48297.76 ms. Allocated memory was 203.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 108.5 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=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] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=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] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=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] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=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] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L796] 0 pthread_t t585; VAL [__unbuffered_cnt=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] [L797] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 pthread_t t586; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=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=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L762] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L738] 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) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L762] 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) [L763] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=2, 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] [L763] 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)) [L764] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=2, 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] [L764] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 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 [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 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 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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))=0, x=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 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)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 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)) [L767] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 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)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L774] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L774] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L774] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L774] 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) [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L776] 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 [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L778] 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 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L805] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L805] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L805] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L805] 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) [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L807] 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 [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L809] 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 [L812] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 47.8s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9205 SDtfs, 8955 SDslu, 20187 SDs, 0 SdLazy, 7441 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 98 SyntacticMatches, 18 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 89516 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2530 NumberOfCodeBlocks, 2530 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2400 ConstructedInterpolants, 0 QuantifiedInterpolants, 481413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...