/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:45:30,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:45:30,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:45:30,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:45:30,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:45:30,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:45:30,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:45:30,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:45:30,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:45:30,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:45:30,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:45:30,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:45:30,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:45:30,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:45:30,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:45:30,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:45:30,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:45:30,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:45:30,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:45:30,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:45:30,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:45:30,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:45:30,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:45:30,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:45:30,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:45:30,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:45:30,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:45:30,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:45:30,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:45:30,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:45:30,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:45:30,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:45:30,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:45:30,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:45:30,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:45:30,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:45:30,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:45:30,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:45:30,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:45:30,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:45:30,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:45:30,138 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-MCR.epf [2019-12-28 03:45:30,152 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:45:30,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:45:30,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:45:30,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:45:30,153 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:45:30,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:45:30,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:45:30,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:45:30,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:45:30,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:45:30,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:45:30,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:45:30,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:45:30,155 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:45:30,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:45:30,155 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:45:30,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:45:30,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:45:30,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:45:30,158 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:45:30,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:45:30,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:45:30,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:45:30,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:45:30,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:45:30,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:45:30,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:45:30,160 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:45:30,161 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:45:30,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:45:30,161 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:45:30,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:45:30,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:45:30,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:45:30,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:45:30,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:45:30,454 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:45:30,455 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i [2019-12-28 03:45:30,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90464d425/ef073e865c00403cb94dd3d6e9703c9e/FLAGa4c171710 [2019-12-28 03:45:31,097 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:45:31,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i [2019-12-28 03:45:31,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90464d425/ef073e865c00403cb94dd3d6e9703c9e/FLAGa4c171710 [2019-12-28 03:45:31,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90464d425/ef073e865c00403cb94dd3d6e9703c9e [2019-12-28 03:45:31,383 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:45:31,385 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:45:31,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:45:31,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:45:31,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:45:31,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:45:31" (1/1) ... [2019-12-28 03:45:31,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad32b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:31, skipping insertion in model container [2019-12-28 03:45:31,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:45:31" (1/1) ... [2019-12-28 03:45:31,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:45:31,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:45:32,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:45:32,163 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:45:32,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:45:32,323 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:45:32,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32 WrapperNode [2019-12-28 03:45:32,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:45:32,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:45:32,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:45:32,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:45:32,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32" (1/1) ... [2019-12-28 03:45:32,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32" (1/1) ... [2019-12-28 03:45:32,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:45:32,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:45:32,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:45:32,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:45:32,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32" (1/1) ... [2019-12-28 03:45:32,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32" (1/1) ... [2019-12-28 03:45:32,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32" (1/1) ... [2019-12-28 03:45:32,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32" (1/1) ... [2019-12-28 03:45:32,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32" (1/1) ... [2019-12-28 03:45:32,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32" (1/1) ... [2019-12-28 03:45:32,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32" (1/1) ... [2019-12-28 03:45:32,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:45:32,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:45:32,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:45:32,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:45:32,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:45:32,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:45:32,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:45:32,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:45:32,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:45:32,522 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:45:32,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:45:32,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:45:32,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:45:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:45:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:45:32,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:45:32,527 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:45:33,232 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:45:33,233 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:45:33,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:45:33 BoogieIcfgContainer [2019-12-28 03:45:33,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:45:33,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:45:33,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:45:33,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:45:33,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:45:31" (1/3) ... [2019-12-28 03:45:33,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546f1a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:45:33, skipping insertion in model container [2019-12-28 03:45:33,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:45:32" (2/3) ... [2019-12-28 03:45:33,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546f1a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:45:33, skipping insertion in model container [2019-12-28 03:45:33,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:45:33" (3/3) ... [2019-12-28 03:45:33,250 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_pso.opt.i [2019-12-28 03:45:33,261 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:45:33,261 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:45:33,276 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:45:33,277 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:45:33,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,328 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,351 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,351 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,363 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,363 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,364 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:45:33,408 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:45:33,432 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:45:33,432 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:45:33,432 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:45:33,432 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:45:33,432 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:45:33,432 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:45:33,433 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:45:33,433 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:45:33,446 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 164 transitions [2019-12-28 03:45:34,958 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25976 states. [2019-12-28 03:45:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 25976 states. [2019-12-28 03:45:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-28 03:45:34,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:34,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] [2019-12-28 03:45:34,971 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2111627556, now seen corresponding path program 1 times [2019-12-28 03:45:34,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:34,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507416799] [2019-12-28 03:45:34,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:35,308 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-28 03:45:35,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507416799] [2019-12-28 03:45:35,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:35,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:45:35,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054463609] [2019-12-28 03:45:35,313 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:35,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:35,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-28 03:45:35,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:35,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:35,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:45:35,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:35,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:45:35,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:45:35,369 INFO L87 Difference]: Start difference. First operand 25976 states. Second operand 4 states. [2019-12-28 03:45:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:36,106 INFO L93 Difference]: Finished difference Result 26616 states and 102121 transitions. [2019-12-28 03:45:36,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:45:36,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-28 03:45:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:36,310 INFO L225 Difference]: With dead ends: 26616 [2019-12-28 03:45:36,310 INFO L226 Difference]: Without dead ends: 20360 [2019-12-28 03:45:36,314 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-28 03:45:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-12-28 03:45:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20360. [2019-12-28 03:45:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-12-28 03:45:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 78425 transitions. [2019-12-28 03:45:38,255 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 78425 transitions. Word has length 39 [2019-12-28 03:45:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:38,256 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 78425 transitions. [2019-12-28 03:45:38,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:45:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 78425 transitions. [2019-12-28 03:45:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 03:45:38,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:38,279 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-28 03:45:38,280 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash 341542856, now seen corresponding path program 1 times [2019-12-28 03:45:38,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:38,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074617060] [2019-12-28 03:45:38,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:38,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-28 03:45:38,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074617060] [2019-12-28 03:45:38,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:38,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:45:38,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1964758445] [2019-12-28 03:45:38,466 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:38,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:38,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 03:45:38,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:38,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:38,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:45:38,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:38,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:45:38,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:45:38,487 INFO L87 Difference]: Start difference. First operand 20360 states and 78425 transitions. Second operand 5 states. [2019-12-28 03:45:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:39,231 INFO L93 Difference]: Finished difference Result 31838 states and 116042 transitions. [2019-12-28 03:45:39,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:45:39,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 03:45:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:40,404 INFO L225 Difference]: With dead ends: 31838 [2019-12-28 03:45:40,404 INFO L226 Difference]: Without dead ends: 31286 [2019-12-28 03:45:40,405 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-28 03:45:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2019-12-28 03:45:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 29705. [2019-12-28 03:45:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29705 states. [2019-12-28 03:45:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 109519 transitions. [2019-12-28 03:45:41,492 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 109519 transitions. Word has length 47 [2019-12-28 03:45:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:41,494 INFO L462 AbstractCegarLoop]: Abstraction has 29705 states and 109519 transitions. [2019-12-28 03:45:41,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:45:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 109519 transitions. [2019-12-28 03:45:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 03:45:41,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:41,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:41,502 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1959299271, now seen corresponding path program 1 times [2019-12-28 03:45:41,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:41,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625400973] [2019-12-28 03:45:41,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:41,596 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-28 03:45:41,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625400973] [2019-12-28 03:45:41,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:41,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:45:41,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1982327632] [2019-12-28 03:45:41,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:41,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:41,622 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 120 transitions. [2019-12-28 03:45:41,622 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:41,711 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:45:41,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:45:41,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:41,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:45:41,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:45:41,713 INFO L87 Difference]: Start difference. First operand 29705 states and 109519 transitions. Second operand 6 states. [2019-12-28 03:45:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:42,581 INFO L93 Difference]: Finished difference Result 38696 states and 139691 transitions. [2019-12-28 03:45:42,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:45:42,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-28 03:45:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:42,725 INFO L225 Difference]: With dead ends: 38696 [2019-12-28 03:45:42,725 INFO L226 Difference]: Without dead ends: 38248 [2019-12-28 03:45:42,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:45:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38248 states. [2019-12-28 03:45:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38248 to 32951. [2019-12-28 03:45:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32951 states. [2019-12-28 03:45:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32951 states to 32951 states and 120528 transitions. [2019-12-28 03:45:45,332 INFO L78 Accepts]: Start accepts. Automaton has 32951 states and 120528 transitions. Word has length 48 [2019-12-28 03:45:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:45,337 INFO L462 AbstractCegarLoop]: Abstraction has 32951 states and 120528 transitions. [2019-12-28 03:45:45,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:45:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 32951 states and 120528 transitions. [2019-12-28 03:45:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 03:45:45,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:45,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:45,350 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:45,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1720517523, now seen corresponding path program 1 times [2019-12-28 03:45:45,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:45,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730282737] [2019-12-28 03:45:45,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:45,403 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-28 03:45:45,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730282737] [2019-12-28 03:45:45,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:45,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:45:45,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1864117861] [2019-12-28 03:45:45,405 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:45,411 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:45,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 138 transitions. [2019-12-28 03:45:45,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:45,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:45:45,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:45:45,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:45,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:45:45,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:45:45,461 INFO L87 Difference]: Start difference. First operand 32951 states and 120528 transitions. Second operand 5 states. [2019-12-28 03:45:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:46,004 INFO L93 Difference]: Finished difference Result 42412 states and 152019 transitions. [2019-12-28 03:45:46,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:45:46,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-28 03:45:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:46,242 INFO L225 Difference]: With dead ends: 42412 [2019-12-28 03:45:46,242 INFO L226 Difference]: Without dead ends: 42412 [2019-12-28 03:45:46,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:45:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42412 states. [2019-12-28 03:45:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42412 to 37665. [2019-12-28 03:45:48,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37665 states. [2019-12-28 03:45:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37665 states to 37665 states and 136332 transitions. [2019-12-28 03:45:48,786 INFO L78 Accepts]: Start accepts. Automaton has 37665 states and 136332 transitions. Word has length 50 [2019-12-28 03:45:48,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:48,786 INFO L462 AbstractCegarLoop]: Abstraction has 37665 states and 136332 transitions. [2019-12-28 03:45:48,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:45:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37665 states and 136332 transitions. [2019-12-28 03:45:48,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:45:48,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:48,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:48,804 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:48,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1662860822, now seen corresponding path program 1 times [2019-12-28 03:45:48,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:48,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852356992] [2019-12-28 03:45:48,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:48,888 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-28 03:45:48,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852356992] [2019-12-28 03:45:48,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:48,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:45:48,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [898150095] [2019-12-28 03:45:48,890 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:48,899 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:48,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 115 states and 174 transitions. [2019-12-28 03:45:48,917 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:48,972 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:45:48,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:45:48,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:48,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:45:48,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:45:48,975 INFO L87 Difference]: Start difference. First operand 37665 states and 136332 transitions. Second operand 8 states. [2019-12-28 03:45:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:50,087 INFO L93 Difference]: Finished difference Result 48756 states and 172981 transitions. [2019-12-28 03:45:50,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:45:50,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-28 03:45:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:50,196 INFO L225 Difference]: With dead ends: 48756 [2019-12-28 03:45:50,196 INFO L226 Difference]: Without dead ends: 48236 [2019-12-28 03:45:50,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:45:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-12-28 03:45:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 38229. [2019-12-28 03:45:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38229 states. [2019-12-28 03:45:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38229 states to 38229 states and 138495 transitions. [2019-12-28 03:45:52,623 INFO L78 Accepts]: Start accepts. Automaton has 38229 states and 138495 transitions. Word has length 54 [2019-12-28 03:45:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:52,623 INFO L462 AbstractCegarLoop]: Abstraction has 38229 states and 138495 transitions. [2019-12-28 03:45:52,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:45:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 38229 states and 138495 transitions. [2019-12-28 03:45:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:45:52,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:52,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:52,637 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:52,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:52,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1119592545, now seen corresponding path program 1 times [2019-12-28 03:45:52,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:52,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929910710] [2019-12-28 03:45:52,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:52,710 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-28 03:45:52,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929910710] [2019-12-28 03:45:52,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:52,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:45:52,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [234290189] [2019-12-28 03:45:52,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:52,717 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:52,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 58 transitions. [2019-12-28 03:45:52,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:52,725 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:45:52,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:45:52,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:52,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:45:52,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:45:52,726 INFO L87 Difference]: Start difference. First operand 38229 states and 138495 transitions. Second operand 3 states. [2019-12-28 03:45:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:53,117 INFO L93 Difference]: Finished difference Result 42347 states and 153425 transitions. [2019-12-28 03:45:53,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:45:53,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-28 03:45:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:53,226 INFO L225 Difference]: With dead ends: 42347 [2019-12-28 03:45:53,226 INFO L226 Difference]: Without dead ends: 42347 [2019-12-28 03:45:53,226 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-28 03:45:53,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42347 states. [2019-12-28 03:45:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42347 to 40235. [2019-12-28 03:45:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40235 states. [2019-12-28 03:45:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40235 states to 40235 states and 145783 transitions. [2019-12-28 03:45:54,221 INFO L78 Accepts]: Start accepts. Automaton has 40235 states and 145783 transitions. Word has length 54 [2019-12-28 03:45:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:54,222 INFO L462 AbstractCegarLoop]: Abstraction has 40235 states and 145783 transitions. [2019-12-28 03:45:54,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:45:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 40235 states and 145783 transitions. [2019-12-28 03:45:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:45:54,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:54,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:54,236 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:54,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1661323295, now seen corresponding path program 1 times [2019-12-28 03:45:54,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:54,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71290237] [2019-12-28 03:45:54,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:54,373 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-28 03:45:54,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71290237] [2019-12-28 03:45:54,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:54,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:45:54,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1839264420] [2019-12-28 03:45:54,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:54,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:54,388 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 58 transitions. [2019-12-28 03:45:54,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:54,413 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:45:54,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:45:54,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:54,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:45:54,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:45:54,414 INFO L87 Difference]: Start difference. First operand 40235 states and 145783 transitions. Second operand 8 states. [2019-12-28 03:45:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:45:55,700 INFO L93 Difference]: Finished difference Result 54445 states and 194725 transitions. [2019-12-28 03:45:55,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:45:55,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-28 03:45:55,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:45:55,818 INFO L225 Difference]: With dead ends: 54445 [2019-12-28 03:45:55,819 INFO L226 Difference]: Without dead ends: 53469 [2019-12-28 03:45:55,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:45:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53469 states. [2019-12-28 03:45:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53469 to 48782. [2019-12-28 03:45:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48782 states. [2019-12-28 03:45:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 175226 transitions. [2019-12-28 03:45:58,468 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 175226 transitions. Word has length 54 [2019-12-28 03:45:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:45:58,469 INFO L462 AbstractCegarLoop]: Abstraction has 48782 states and 175226 transitions. [2019-12-28 03:45:58,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:45:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 175226 transitions. [2019-12-28 03:45:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:45:58,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:45:58,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:45:58,482 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:45:58,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:45:58,483 INFO L82 PathProgramCache]: Analyzing trace with hash -135628064, now seen corresponding path program 1 times [2019-12-28 03:45:58,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:45:58,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859861541] [2019-12-28 03:45:58,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:45:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:45:58,599 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-28 03:45:58,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859861541] [2019-12-28 03:45:58,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:45:58,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:45:58,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [982856525] [2019-12-28 03:45:58,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:45:58,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:45:58,612 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 58 transitions. [2019-12-28 03:45:58,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:45:58,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:45:58,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:45:58,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:45:58,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:45:58,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:45:58,645 INFO L87 Difference]: Start difference. First operand 48782 states and 175226 transitions. Second operand 9 states. [2019-12-28 03:46:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:00,240 INFO L93 Difference]: Finished difference Result 70897 states and 244523 transitions. [2019-12-28 03:46:00,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:46:00,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-28 03:46:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:00,399 INFO L225 Difference]: With dead ends: 70897 [2019-12-28 03:46:00,400 INFO L226 Difference]: Without dead ends: 70897 [2019-12-28 03:46:00,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:46:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2019-12-28 03:46:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 57890. [2019-12-28 03:46:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57890 states. [2019-12-28 03:46:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57890 states to 57890 states and 203150 transitions. [2019-12-28 03:46:03,698 INFO L78 Accepts]: Start accepts. Automaton has 57890 states and 203150 transitions. Word has length 54 [2019-12-28 03:46:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:03,698 INFO L462 AbstractCegarLoop]: Abstraction has 57890 states and 203150 transitions. [2019-12-28 03:46:03,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:46:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 57890 states and 203150 transitions. [2019-12-28 03:46:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:46:03,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:03,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:46:03,712 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:03,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:03,712 INFO L82 PathProgramCache]: Analyzing trace with hash 751875617, now seen corresponding path program 1 times [2019-12-28 03:46:03,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:03,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831950487] [2019-12-28 03:46:03,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:03,757 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-28 03:46:03,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831950487] [2019-12-28 03:46:03,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:03,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:46:03,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103095965] [2019-12-28 03:46:03,758 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:03,763 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:03,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 58 transitions. [2019-12-28 03:46:03,770 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:03,770 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:03,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:46:03,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:03,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:46:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:46:03,771 INFO L87 Difference]: Start difference. First operand 57890 states and 203150 transitions. Second operand 3 states. [2019-12-28 03:46:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:03,972 INFO L93 Difference]: Finished difference Result 43856 states and 152833 transitions. [2019-12-28 03:46:03,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:46:03,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-28 03:46:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:04,048 INFO L225 Difference]: With dead ends: 43856 [2019-12-28 03:46:04,049 INFO L226 Difference]: Without dead ends: 43352 [2019-12-28 03:46:04,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:46:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43352 states. [2019-12-28 03:46:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43352 to 41886. [2019-12-28 03:46:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41886 states. [2019-12-28 03:46:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41886 states to 41886 states and 146704 transitions. [2019-12-28 03:46:05,165 INFO L78 Accepts]: Start accepts. Automaton has 41886 states and 146704 transitions. Word has length 54 [2019-12-28 03:46:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:05,165 INFO L462 AbstractCegarLoop]: Abstraction has 41886 states and 146704 transitions. [2019-12-28 03:46:05,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:46:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 41886 states and 146704 transitions. [2019-12-28 03:46:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:46:05,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:05,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:46:05,177 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:05,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:05,177 INFO L82 PathProgramCache]: Analyzing trace with hash 807428207, now seen corresponding path program 1 times [2019-12-28 03:46:05,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:05,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047895422] [2019-12-28 03:46:05,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:46:05,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047895422] [2019-12-28 03:46:05,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:05,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:46:05,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [4854292] [2019-12-28 03:46:05,263 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:05,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:05,274 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 55 transitions. [2019-12-28 03:46:05,275 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:05,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:05,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:46:05,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:05,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:46:05,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:46:05,276 INFO L87 Difference]: Start difference. First operand 41886 states and 146704 transitions. Second operand 6 states. [2019-12-28 03:46:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:05,911 INFO L93 Difference]: Finished difference Result 54549 states and 184834 transitions. [2019-12-28 03:46:05,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:46:05,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-28 03:46:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:06,015 INFO L225 Difference]: With dead ends: 54549 [2019-12-28 03:46:06,016 INFO L226 Difference]: Without dead ends: 54549 [2019-12-28 03:46:06,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:46:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54549 states. [2019-12-28 03:46:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54549 to 45861. [2019-12-28 03:46:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45861 states. [2019-12-28 03:46:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45861 states to 45861 states and 158167 transitions. [2019-12-28 03:46:07,419 INFO L78 Accepts]: Start accepts. Automaton has 45861 states and 158167 transitions. Word has length 55 [2019-12-28 03:46:07,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:07,419 INFO L462 AbstractCegarLoop]: Abstraction has 45861 states and 158167 transitions. [2019-12-28 03:46:07,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:46:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 45861 states and 158167 transitions. [2019-12-28 03:46:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:46:07,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:07,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:46:07,431 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:07,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1694931888, now seen corresponding path program 1 times [2019-12-28 03:46:07,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:07,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685466781] [2019-12-28 03:46:07,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:07,504 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-28 03:46:07,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685466781] [2019-12-28 03:46:07,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:07,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:46:07,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [764468739] [2019-12-28 03:46:07,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:07,510 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:07,516 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 55 transitions. [2019-12-28 03:46:07,517 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:07,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:07,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:46:07,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:07,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:46:07,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:46:07,518 INFO L87 Difference]: Start difference. First operand 45861 states and 158167 transitions. Second operand 4 states. [2019-12-28 03:46:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:07,572 INFO L93 Difference]: Finished difference Result 8163 states and 24871 transitions. [2019-12-28 03:46:07,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:46:07,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-28 03:46:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:07,583 INFO L225 Difference]: With dead ends: 8163 [2019-12-28 03:46:07,584 INFO L226 Difference]: Without dead ends: 6754 [2019-12-28 03:46:07,584 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-28 03:46:07,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2019-12-28 03:46:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 6706. [2019-12-28 03:46:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6706 states. [2019-12-28 03:46:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 20040 transitions. [2019-12-28 03:46:07,667 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 20040 transitions. Word has length 55 [2019-12-28 03:46:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:07,667 INFO L462 AbstractCegarLoop]: Abstraction has 6706 states and 20040 transitions. [2019-12-28 03:46:07,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:46:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 20040 transitions. [2019-12-28 03:46:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 03:46:07,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:07,671 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] [2019-12-28 03:46:07,671 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:07,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2058299368, now seen corresponding path program 1 times [2019-12-28 03:46:07,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:07,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727716302] [2019-12-28 03:46:07,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:07,720 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-28 03:46:07,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727716302] [2019-12-28 03:46:07,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:07,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:46:07,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207361499] [2019-12-28 03:46:07,722 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:07,731 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:07,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 200 transitions. [2019-12-28 03:46:07,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:07,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:46:07,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:46:07,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:46:07,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:46:07,779 INFO L87 Difference]: Start difference. First operand 6706 states and 20040 transitions. Second operand 5 states. [2019-12-28 03:46:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:07,962 INFO L93 Difference]: Finished difference Result 7891 states and 23389 transitions. [2019-12-28 03:46:07,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:46:07,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-28 03:46:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:07,976 INFO L225 Difference]: With dead ends: 7891 [2019-12-28 03:46:07,977 INFO L226 Difference]: Without dead ends: 7891 [2019-12-28 03:46:07,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:46:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2019-12-28 03:46:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7213. [2019-12-28 03:46:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7213 states. [2019-12-28 03:46:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7213 states to 7213 states and 21446 transitions. [2019-12-28 03:46:08,125 INFO L78 Accepts]: Start accepts. Automaton has 7213 states and 21446 transitions. Word has length 64 [2019-12-28 03:46:08,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:08,126 INFO L462 AbstractCegarLoop]: Abstraction has 7213 states and 21446 transitions. [2019-12-28 03:46:08,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:46:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 7213 states and 21446 transitions. [2019-12-28 03:46:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-28 03:46:08,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:08,132 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] [2019-12-28 03:46:08,132 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:08,133 INFO L82 PathProgramCache]: Analyzing trace with hash -315489033, now seen corresponding path program 1 times [2019-12-28 03:46:08,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:08,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605052119] [2019-12-28 03:46:08,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:08,212 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-28 03:46:08,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605052119] [2019-12-28 03:46:08,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:08,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:46:08,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1488814790] [2019-12-28 03:46:08,214 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:08,223 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:08,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 200 transitions. [2019-12-28 03:46:08,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:08,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:46:08,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:46:08,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:08,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:46:08,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:46:08,270 INFO L87 Difference]: Start difference. First operand 7213 states and 21446 transitions. Second operand 7 states. [2019-12-28 03:46:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:08,654 INFO L93 Difference]: Finished difference Result 9268 states and 27195 transitions. [2019-12-28 03:46:08,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:46:08,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-28 03:46:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:08,667 INFO L225 Difference]: With dead ends: 9268 [2019-12-28 03:46:08,667 INFO L226 Difference]: Without dead ends: 9220 [2019-12-28 03:46:08,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:46:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9220 states. [2019-12-28 03:46:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9220 to 8052. [2019-12-28 03:46:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8052 states. [2019-12-28 03:46:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 23826 transitions. [2019-12-28 03:46:09,039 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 23826 transitions. Word has length 64 [2019-12-28 03:46:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:09,039 INFO L462 AbstractCegarLoop]: Abstraction has 8052 states and 23826 transitions. [2019-12-28 03:46:09,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:46:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 23826 transitions. [2019-12-28 03:46:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:46:09,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:09,045 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] [2019-12-28 03:46:09,046 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:09,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:09,046 INFO L82 PathProgramCache]: Analyzing trace with hash 502763189, now seen corresponding path program 1 times [2019-12-28 03:46:09,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:09,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396339002] [2019-12-28 03:46:09,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:09,119 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-28 03:46:09,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396339002] [2019-12-28 03:46:09,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:09,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:46:09,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1884570866] [2019-12-28 03:46:09,121 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:09,134 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:09,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:46:09,150 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:09,150 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:09,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:46:09,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:09,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:46:09,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:46:09,151 INFO L87 Difference]: Start difference. First operand 8052 states and 23826 transitions. Second operand 4 states. [2019-12-28 03:46:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:09,383 INFO L93 Difference]: Finished difference Result 10665 states and 31175 transitions. [2019-12-28 03:46:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:46:09,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-28 03:46:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:09,397 INFO L225 Difference]: With dead ends: 10665 [2019-12-28 03:46:09,398 INFO L226 Difference]: Without dead ends: 10665 [2019-12-28 03:46:09,398 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-28 03:46:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10665 states. [2019-12-28 03:46:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10665 to 9075. [2019-12-28 03:46:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9075 states. [2019-12-28 03:46:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 26645 transitions. [2019-12-28 03:46:09,519 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 26645 transitions. Word has length 68 [2019-12-28 03:46:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:09,519 INFO L462 AbstractCegarLoop]: Abstraction has 9075 states and 26645 transitions. [2019-12-28 03:46:09,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:46:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 26645 transitions. [2019-12-28 03:46:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:46:09,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:09,527 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] [2019-12-28 03:46:09,527 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:09,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:09,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1747527670, now seen corresponding path program 1 times [2019-12-28 03:46:09,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:09,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209949472] [2019-12-28 03:46:09,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:09,645 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-28 03:46:09,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209949472] [2019-12-28 03:46:09,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:09,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:46:09,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1282343370] [2019-12-28 03:46:09,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:09,657 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:09,668 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:46:09,668 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:09,668 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:09,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:46:09,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:09,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:46:09,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:46:09,669 INFO L87 Difference]: Start difference. First operand 9075 states and 26645 transitions. Second operand 6 states. [2019-12-28 03:46:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:10,247 INFO L93 Difference]: Finished difference Result 10385 states and 29896 transitions. [2019-12-28 03:46:10,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:46:10,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 03:46:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:10,261 INFO L225 Difference]: With dead ends: 10385 [2019-12-28 03:46:10,261 INFO L226 Difference]: Without dead ends: 10385 [2019-12-28 03:46:10,261 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-28 03:46:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10385 states. [2019-12-28 03:46:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10385 to 10082. [2019-12-28 03:46:10,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10082 states. [2019-12-28 03:46:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10082 states to 10082 states and 29119 transitions. [2019-12-28 03:46:10,398 INFO L78 Accepts]: Start accepts. Automaton has 10082 states and 29119 transitions. Word has length 68 [2019-12-28 03:46:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:10,399 INFO L462 AbstractCegarLoop]: Abstraction has 10082 states and 29119 transitions. [2019-12-28 03:46:10,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:46:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 10082 states and 29119 transitions. [2019-12-28 03:46:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:46:10,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:10,411 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] [2019-12-28 03:46:10,411 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:10,411 INFO L82 PathProgramCache]: Analyzing trace with hash -329681673, now seen corresponding path program 1 times [2019-12-28 03:46:10,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:10,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823036198] [2019-12-28 03:46:10,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:10,535 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-28 03:46:10,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823036198] [2019-12-28 03:46:10,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:10,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:46:10,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1601996169] [2019-12-28 03:46:10,536 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:10,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:10,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:46:10,562 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:10,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:10,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:46:10,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:10,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:46:10,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:46:10,564 INFO L87 Difference]: Start difference. First operand 10082 states and 29119 transitions. Second operand 6 states. [2019-12-28 03:46:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:10,962 INFO L93 Difference]: Finished difference Result 11999 states and 33626 transitions. [2019-12-28 03:46:10,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:46:10,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 03:46:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:10,977 INFO L225 Difference]: With dead ends: 11999 [2019-12-28 03:46:10,977 INFO L226 Difference]: Without dead ends: 11999 [2019-12-28 03:46:10,977 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-28 03:46:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11999 states. [2019-12-28 03:46:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11999 to 10301. [2019-12-28 03:46:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-12-28 03:46:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 29171 transitions. [2019-12-28 03:46:11,108 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 29171 transitions. Word has length 68 [2019-12-28 03:46:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:11,108 INFO L462 AbstractCegarLoop]: Abstraction has 10301 states and 29171 transitions. [2019-12-28 03:46:11,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:46:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 29171 transitions. [2019-12-28 03:46:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:46:11,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:11,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:46:11,115 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash -118330760, now seen corresponding path program 1 times [2019-12-28 03:46:11,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:11,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447894983] [2019-12-28 03:46:11,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:46:11,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447894983] [2019-12-28 03:46:11,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:11,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:46:11,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [280093850] [2019-12-28 03:46:11,172 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:11,196 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:11,209 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:46:11,209 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:11,210 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:11,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:46:11,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:11,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:46:11,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:46:11,211 INFO L87 Difference]: Start difference. First operand 10301 states and 29171 transitions. Second operand 5 states. [2019-12-28 03:46:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:11,578 INFO L93 Difference]: Finished difference Result 12576 states and 35464 transitions. [2019-12-28 03:46:11,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:46:11,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-28 03:46:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:11,596 INFO L225 Difference]: With dead ends: 12576 [2019-12-28 03:46:11,596 INFO L226 Difference]: Without dead ends: 12576 [2019-12-28 03:46:11,597 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-28 03:46:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2019-12-28 03:46:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 11076. [2019-12-28 03:46:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11076 states. [2019-12-28 03:46:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 31105 transitions. [2019-12-28 03:46:11,742 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 31105 transitions. Word has length 68 [2019-12-28 03:46:11,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:11,742 INFO L462 AbstractCegarLoop]: Abstraction has 11076 states and 31105 transitions. [2019-12-28 03:46:11,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:46:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 31105 transitions. [2019-12-28 03:46:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:46:11,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:11,749 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] [2019-12-28 03:46:11,750 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:11,750 INFO L82 PathProgramCache]: Analyzing trace with hash -628864937, now seen corresponding path program 1 times [2019-12-28 03:46:11,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:11,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122672184] [2019-12-28 03:46:11,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:11,829 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-28 03:46:11,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122672184] [2019-12-28 03:46:11,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:11,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:46:11,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [672136529] [2019-12-28 03:46:11,830 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:11,861 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:11,878 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:46:11,878 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:11,879 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:11,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:46:11,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:11,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:46:11,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:46:11,886 INFO L87 Difference]: Start difference. First operand 11076 states and 31105 transitions. Second operand 6 states. [2019-12-28 03:46:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:12,761 INFO L93 Difference]: Finished difference Result 17070 states and 47866 transitions. [2019-12-28 03:46:12,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:46:12,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 03:46:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:12,785 INFO L225 Difference]: With dead ends: 17070 [2019-12-28 03:46:12,785 INFO L226 Difference]: Without dead ends: 17070 [2019-12-28 03:46:12,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:46:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17070 states. [2019-12-28 03:46:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17070 to 14148. [2019-12-28 03:46:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14148 states. [2019-12-28 03:46:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14148 states to 14148 states and 39930 transitions. [2019-12-28 03:46:12,984 INFO L78 Accepts]: Start accepts. Automaton has 14148 states and 39930 transitions. Word has length 68 [2019-12-28 03:46:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:12,984 INFO L462 AbstractCegarLoop]: Abstraction has 14148 states and 39930 transitions. [2019-12-28 03:46:12,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:46:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 14148 states and 39930 transitions. [2019-12-28 03:46:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:46:12,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:12,992 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] [2019-12-28 03:46:12,992 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:12,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:12,993 INFO L82 PathProgramCache]: Analyzing trace with hash 258638744, now seen corresponding path program 1 times [2019-12-28 03:46:12,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:12,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389721953] [2019-12-28 03:46:12,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:13,075 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-28 03:46:13,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389721953] [2019-12-28 03:46:13,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:13,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:46:13,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1975779760] [2019-12-28 03:46:13,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:13,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:13,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:46:13,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:13,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:13,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:46:13,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:46:13,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:46:13,103 INFO L87 Difference]: Start difference. First operand 14148 states and 39930 transitions. Second operand 4 states. [2019-12-28 03:46:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:13,547 INFO L93 Difference]: Finished difference Result 14460 states and 40606 transitions. [2019-12-28 03:46:13,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:46:13,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-28 03:46:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:13,565 INFO L225 Difference]: With dead ends: 14460 [2019-12-28 03:46:13,566 INFO L226 Difference]: Without dead ends: 13986 [2019-12-28 03:46:13,566 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-28 03:46:13,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13986 states. [2019-12-28 03:46:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13986 to 13425. [2019-12-28 03:46:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13425 states. [2019-12-28 03:46:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13425 states to 13425 states and 37675 transitions. [2019-12-28 03:46:13,736 INFO L78 Accepts]: Start accepts. Automaton has 13425 states and 37675 transitions. Word has length 68 [2019-12-28 03:46:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:13,736 INFO L462 AbstractCegarLoop]: Abstraction has 13425 states and 37675 transitions. [2019-12-28 03:46:13,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:46:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 13425 states and 37675 transitions. [2019-12-28 03:46:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:46:13,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:13,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:46:13,744 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:13,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:13,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1869151000, now seen corresponding path program 1 times [2019-12-28 03:46:13,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:13,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702063064] [2019-12-28 03:46:13,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:13,860 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-28 03:46:13,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702063064] [2019-12-28 03:46:13,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:13,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:46:13,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [215593954] [2019-12-28 03:46:13,862 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:13,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:13,877 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:46:13,878 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:13,878 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:13,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:46:13,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:13,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:46:13,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:46:13,879 INFO L87 Difference]: Start difference. First operand 13425 states and 37675 transitions. Second operand 9 states. [2019-12-28 03:46:14,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:14,610 INFO L93 Difference]: Finished difference Result 19154 states and 53543 transitions. [2019-12-28 03:46:14,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:46:14,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-28 03:46:14,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:14,634 INFO L225 Difference]: With dead ends: 19154 [2019-12-28 03:46:14,635 INFO L226 Difference]: Without dead ends: 19154 [2019-12-28 03:46:14,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:46:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2019-12-28 03:46:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 15590. [2019-12-28 03:46:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15590 states. [2019-12-28 03:46:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15590 states to 15590 states and 43630 transitions. [2019-12-28 03:46:14,843 INFO L78 Accepts]: Start accepts. Automaton has 15590 states and 43630 transitions. Word has length 68 [2019-12-28 03:46:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:14,843 INFO L462 AbstractCegarLoop]: Abstraction has 15590 states and 43630 transitions. [2019-12-28 03:46:14,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:46:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 15590 states and 43630 transitions. [2019-12-28 03:46:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:46:14,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:14,852 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] [2019-12-28 03:46:14,852 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:14,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1538312615, now seen corresponding path program 1 times [2019-12-28 03:46:14,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:14,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283889709] [2019-12-28 03:46:14,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:46:14,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283889709] [2019-12-28 03:46:14,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:14,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:46:14,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409441701] [2019-12-28 03:46:14,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:14,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:14,944 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 03:46:14,944 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:14,945 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:14,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:46:14,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:14,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:46:14,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:46:14,946 INFO L87 Difference]: Start difference. First operand 15590 states and 43630 transitions. Second operand 5 states. [2019-12-28 03:46:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:14,995 INFO L93 Difference]: Finished difference Result 4904 states and 11471 transitions. [2019-12-28 03:46:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:46:14,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-28 03:46:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:15,001 INFO L225 Difference]: With dead ends: 4904 [2019-12-28 03:46:15,001 INFO L226 Difference]: Without dead ends: 4032 [2019-12-28 03:46:15,001 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-28 03:46:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2019-12-28 03:46:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3409. [2019-12-28 03:46:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-12-28 03:46:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 7848 transitions. [2019-12-28 03:46:15,073 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 7848 transitions. Word has length 68 [2019-12-28 03:46:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:15,073 INFO L462 AbstractCegarLoop]: Abstraction has 3409 states and 7848 transitions. [2019-12-28 03:46:15,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:46:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 7848 transitions. [2019-12-28 03:46:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:46:15,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:15,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:46:15,078 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:15,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:15,079 INFO L82 PathProgramCache]: Analyzing trace with hash 814821392, now seen corresponding path program 1 times [2019-12-28 03:46:15,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:15,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755973040] [2019-12-28 03:46:15,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:15,157 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-28 03:46:15,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755973040] [2019-12-28 03:46:15,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:15,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:46:15,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1717835018] [2019-12-28 03:46:15,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:15,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:15,272 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 175 transitions. [2019-12-28 03:46:15,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:15,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:15,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:46:15,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:15,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:46:15,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:46:15,276 INFO L87 Difference]: Start difference. First operand 3409 states and 7848 transitions. Second operand 4 states. [2019-12-28 03:46:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:15,321 INFO L93 Difference]: Finished difference Result 3364 states and 7725 transitions. [2019-12-28 03:46:15,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:46:15,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-28 03:46:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:15,328 INFO L225 Difference]: With dead ends: 3364 [2019-12-28 03:46:15,328 INFO L226 Difference]: Without dead ends: 3364 [2019-12-28 03:46:15,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-28 03:46:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2019-12-28 03:46:15,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 2982. [2019-12-28 03:46:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-12-28 03:46:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 6852 transitions. [2019-12-28 03:46:15,391 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 6852 transitions. Word has length 85 [2019-12-28 03:46:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:15,392 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 6852 transitions. [2019-12-28 03:46:15,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:46:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 6852 transitions. [2019-12-28 03:46:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:46:15,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:15,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:46:15,399 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1492664144, now seen corresponding path program 1 times [2019-12-28 03:46:15,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:15,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377430697] [2019-12-28 03:46:15,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:15,617 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-28 03:46:15,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377430697] [2019-12-28 03:46:15,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:15,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:46:15,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [293582543] [2019-12-28 03:46:15,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:15,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:15,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 175 transitions. [2019-12-28 03:46:15,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:15,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 03:46:15,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 03:46:15,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:15,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 03:46:15,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:46:15,788 INFO L87 Difference]: Start difference. First operand 2982 states and 6852 transitions. Second operand 11 states. [2019-12-28 03:46:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:17,385 INFO L93 Difference]: Finished difference Result 4025 states and 9104 transitions. [2019-12-28 03:46:17,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 03:46:17,386 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-12-28 03:46:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:17,391 INFO L225 Difference]: With dead ends: 4025 [2019-12-28 03:46:17,391 INFO L226 Difference]: Without dead ends: 4003 [2019-12-28 03:46:17,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-12-28 03:46:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4003 states. [2019-12-28 03:46:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4003 to 3165. [2019-12-28 03:46:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3165 states. [2019-12-28 03:46:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 7225 transitions. [2019-12-28 03:46:17,424 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 7225 transitions. Word has length 85 [2019-12-28 03:46:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:17,424 INFO L462 AbstractCegarLoop]: Abstraction has 3165 states and 7225 transitions. [2019-12-28 03:46:17,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 03:46:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 7225 transitions. [2019-12-28 03:46:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:46:17,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:17,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:46:17,427 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:17,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:17,428 INFO L82 PathProgramCache]: Analyzing trace with hash -605160463, now seen corresponding path program 1 times [2019-12-28 03:46:17,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:17,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848764399] [2019-12-28 03:46:17,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:17,571 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-28 03:46:17,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848764399] [2019-12-28 03:46:17,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:17,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:46:17,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915642802] [2019-12-28 03:46:17,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:17,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:17,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 175 transitions. [2019-12-28 03:46:17,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:17,648 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:17,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:46:17,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:46:17,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:46:17,649 INFO L87 Difference]: Start difference. First operand 3165 states and 7225 transitions. Second operand 9 states. [2019-12-28 03:46:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:18,255 INFO L93 Difference]: Finished difference Result 11435 states and 26306 transitions. [2019-12-28 03:46:18,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 03:46:18,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-12-28 03:46:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:18,266 INFO L225 Difference]: With dead ends: 11435 [2019-12-28 03:46:18,266 INFO L226 Difference]: Without dead ends: 7337 [2019-12-28 03:46:18,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-28 03:46:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7337 states. [2019-12-28 03:46:18,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7337 to 3288. [2019-12-28 03:46:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2019-12-28 03:46:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 7466 transitions. [2019-12-28 03:46:18,318 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 7466 transitions. Word has length 85 [2019-12-28 03:46:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:18,318 INFO L462 AbstractCegarLoop]: Abstraction has 3288 states and 7466 transitions. [2019-12-28 03:46:18,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:46:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 7466 transitions. [2019-12-28 03:46:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:46:18,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:18,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:46:18,323 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:18,323 INFO L82 PathProgramCache]: Analyzing trace with hash -779070116, now seen corresponding path program 1 times [2019-12-28 03:46:18,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:18,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743841183] [2019-12-28 03:46:18,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:18,470 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-28 03:46:18,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743841183] [2019-12-28 03:46:18,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:18,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:46:18,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [777360735] [2019-12-28 03:46:18,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:18,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:18,534 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 145 transitions. [2019-12-28 03:46:18,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:18,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:46:18,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:46:18,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:18,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:46:18,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:46:18,562 INFO L87 Difference]: Start difference. First operand 3288 states and 7466 transitions. Second operand 8 states. [2019-12-28 03:46:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:19,102 INFO L93 Difference]: Finished difference Result 3762 states and 8460 transitions. [2019-12-28 03:46:19,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:46:19,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-12-28 03:46:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:19,108 INFO L225 Difference]: With dead ends: 3762 [2019-12-28 03:46:19,108 INFO L226 Difference]: Without dead ends: 3686 [2019-12-28 03:46:19,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:46:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2019-12-28 03:46:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3182. [2019-12-28 03:46:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3182 states. [2019-12-28 03:46:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 7161 transitions. [2019-12-28 03:46:19,178 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 7161 transitions. Word has length 85 [2019-12-28 03:46:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:19,179 INFO L462 AbstractCegarLoop]: Abstraction has 3182 states and 7161 transitions. [2019-12-28 03:46:19,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:46:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 7161 transitions. [2019-12-28 03:46:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:46:19,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:19,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:46:19,186 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:19,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:19,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1438687837, now seen corresponding path program 2 times [2019-12-28 03:46:19,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:19,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672721363] [2019-12-28 03:46:19,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:46:19,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672721363] [2019-12-28 03:46:19,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:19,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:46:19,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1665060122] [2019-12-28 03:46:19,420 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:19,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:19,513 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 145 transitions. [2019-12-28 03:46:19,513 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:19,514 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:19,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:46:19,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:19,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:46:19,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:46:19,516 INFO L87 Difference]: Start difference. First operand 3182 states and 7161 transitions. Second operand 7 states. [2019-12-28 03:46:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:19,636 INFO L93 Difference]: Finished difference Result 5397 states and 12204 transitions. [2019-12-28 03:46:19,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:46:19,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-12-28 03:46:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:19,641 INFO L225 Difference]: With dead ends: 5397 [2019-12-28 03:46:19,641 INFO L226 Difference]: Without dead ends: 2304 [2019-12-28 03:46:19,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:46:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2019-12-28 03:46:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2019-12-28 03:46:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-12-28 03:46:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 5189 transitions. [2019-12-28 03:46:19,688 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 5189 transitions. Word has length 85 [2019-12-28 03:46:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:19,688 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 5189 transitions. [2019-12-28 03:46:19,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:46:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 5189 transitions. [2019-12-28 03:46:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:46:19,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:19,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:46:19,693 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:19,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1677225695, now seen corresponding path program 3 times [2019-12-28 03:46:19,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:19,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580906525] [2019-12-28 03:46:19,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:46:19,856 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-28 03:46:19,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580906525] [2019-12-28 03:46:19,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:46:19,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:46:19,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2053290161] [2019-12-28 03:46:19,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:46:19,887 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:46:19,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 135 transitions. [2019-12-28 03:46:19,949 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:46:19,950 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:46:19,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:46:19,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:46:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:46:19,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:46:19,951 INFO L87 Difference]: Start difference. First operand 2304 states and 5189 transitions. Second operand 5 states. [2019-12-28 03:46:20,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:46:20,011 INFO L93 Difference]: Finished difference Result 2429 states and 5444 transitions. [2019-12-28 03:46:20,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:46:20,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-28 03:46:20,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:46:20,016 INFO L225 Difference]: With dead ends: 2429 [2019-12-28 03:46:20,016 INFO L226 Difference]: Without dead ends: 2429 [2019-12-28 03:46:20,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:46:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2019-12-28 03:46:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2388. [2019-12-28 03:46:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-12-28 03:46:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5359 transitions. [2019-12-28 03:46:20,065 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5359 transitions. Word has length 85 [2019-12-28 03:46:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:46:20,066 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5359 transitions. [2019-12-28 03:46:20,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:46:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5359 transitions. [2019-12-28 03:46:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-28 03:46:20,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:46:20,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:46:20,072 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:46:20,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:46:20,073 INFO L82 PathProgramCache]: Analyzing trace with hash -641388152, now seen corresponding path program 1 times [2019-12-28 03:46:20,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:46:20,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086853904] [2019-12-28 03:46:20,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:46:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:46:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:46:20,187 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:46:20,187 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:46:20,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:46:20 BasicIcfg [2019-12-28 03:46:20,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:46:20,425 INFO L168 Benchmark]: Toolchain (without parser) took 49040.62 ms. Allocated memory was 138.9 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 102.2 MB in the beginning and 696.7 MB in the end (delta: -594.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-28 03:46:20,427 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-28 03:46:20,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 935.43 ms. Allocated memory was 138.9 MB in the beginning and 206.6 MB in the end (delta: 67.6 MB). Free memory was 101.8 MB in the beginning and 159.2 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-28 03:46:20,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.08 ms. Allocated memory is still 206.6 MB. Free memory was 159.2 MB in the beginning and 156.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 03:46:20,429 INFO L168 Benchmark]: Boogie Preprocessor took 47.26 ms. Allocated memory is still 206.6 MB. Free memory was 156.5 MB in the beginning and 154.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 03:46:20,429 INFO L168 Benchmark]: RCFGBuilder took 774.78 ms. Allocated memory is still 206.6 MB. Free memory was 154.5 MB in the beginning and 113.6 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. [2019-12-28 03:46:20,430 INFO L168 Benchmark]: TraceAbstraction took 47185.45 ms. Allocated memory was 206.6 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 112.9 MB in the beginning and 696.7 MB in the end (delta: -583.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-28 03:46:20,441 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 935.43 ms. Allocated memory was 138.9 MB in the beginning and 206.6 MB in the end (delta: 67.6 MB). Free memory was 101.8 MB in the beginning and 159.2 MB in the end (delta: -57.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.08 ms. Allocated memory is still 206.6 MB. Free memory was 159.2 MB in the beginning and 156.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.26 ms. Allocated memory is still 206.6 MB. Free memory was 156.5 MB in the beginning and 154.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 774.78 ms. Allocated memory is still 206.6 MB. Free memory was 154.5 MB in the beginning and 113.6 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47185.45 ms. Allocated memory was 206.6 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 112.9 MB in the beginning and 696.7 MB in the end (delta: -583.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 0 pthread_t t1639; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] FCALL, FORK 0 pthread_create(&t1639, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 0 pthread_t t1640; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1640, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 46.7s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7266 SDtfs, 9325 SDslu, 17695 SDs, 0 SdLazy, 6902 SolverSat, 465 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 96 SyntacticMatches, 12 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57890occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 72061 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1831 NumberOfCodeBlocks, 1831 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1719 ConstructedInterpolants, 0 QuantifiedInterpolants, 350736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...